java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 21:55:29,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 21:55:29,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 21:55:29,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 21:55:29,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 21:55:29,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 21:55:29,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 21:55:29,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 21:55:29,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 21:55:29,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 21:55:29,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 21:55:29,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 21:55:29,174 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 21:55:29,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 21:55:29,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 21:55:29,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 21:55:29,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 21:55:29,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 21:55:29,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 21:55:29,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 21:55:29,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 21:55:29,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 21:55:29,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 21:55:29,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 21:55:29,191 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 21:55:29,192 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 21:55:29,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 21:55:29,193 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 21:55:29,193 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 21:55:29,194 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 21:55:29,194 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 21:55:29,195 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-20 21:55:29,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 21:55:29,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 21:55:29,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 21:55:29,204 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 21:55:29,204 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 21:55:29,204 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 21:55:29,204 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 21:55:29,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 21:55:29,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 21:55:29,205 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 21:55:29,205 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 21:55:29,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 21:55:29,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 21:55:29,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 21:55:29,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 21:55:29,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 21:55:29,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 21:55:29,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 21:55:29,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 21:55:29,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 21:55:29,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 21:55:29,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 21:55:29,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 21:55:29,207 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 21:55:29,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 21:55:29,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 21:55:29,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 21:55:29,208 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 21:55:29,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 21:55:29,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 21:55:29,208 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 21:55:29,208 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 21:55:29,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 21:55:29,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 21:55:29,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 21:55:29,209 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 21:55:29,210 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 21:55:29,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 21:55:29,252 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 21:55:29,256 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 21:55:29,257 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 21:55:29,257 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 21:55:29,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-01-20 21:55:29,418 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 21:55:29,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 21:55:29,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 21:55:29,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 21:55:29,430 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 21:55:29,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2fa6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29, skipping insertion in model container [2018-01-20 21:55:29,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,450 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:55:29,491 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 21:55:29,612 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:55:29,633 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 21:55:29,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29 WrapperNode [2018-01-20 21:55:29,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 21:55:29,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 21:55:29,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 21:55:29,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 21:55:29,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (1/1) ... [2018-01-20 21:55:29,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 21:55:29,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 21:55:29,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 21:55:29,681 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 21:55:29,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (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-20 21:55:29,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 21:55:29,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 21:55:29,730 INFO L136 BoogieDeclarations]: Found implementation of procedure diff [2018-01-20 21:55:29,730 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 21:55:29,730 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 21:55:29,730 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 21:55:29,730 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 21:55:29,730 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 21:55:29,730 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 21:55:29,731 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 21:55:29,731 INFO L128 BoogieDeclarations]: Found specification of procedure diff [2018-01-20 21:55:29,731 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 21:55:29,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 21:55:29,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 21:55:29,943 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 21:55:29,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:55:29 BoogieIcfgContainer [2018-01-20 21:55:29,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 21:55:29,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 21:55:29,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 21:55:29,964 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 21:55:29,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 09:55:29" (1/3) ... [2018-01-20 21:55:29,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1b6b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:55:29, skipping insertion in model container [2018-01-20 21:55:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 09:55:29" (2/3) ... [2018-01-20 21:55:29,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1b6b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:55:29, skipping insertion in model container [2018-01-20 21:55:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:55:29" (3/3) ... [2018-01-20 21:55:29,968 INFO L105 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-01-20 21:55:29,974 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 21:55:29,979 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 21:55:30,024 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:30,024 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:30,024 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:30,025 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:30,025 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:30,025 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:30,025 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:30,025 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 21:55:30,026 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:55:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 21:55:30,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:30,056 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 21:55:30,056 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 21:55:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-20 21:55:30,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:30,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:30,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:30,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:30,169 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:55:30,175 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:30,181 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:30,181 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:30,182 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:30,182 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:30,182 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:30,182 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:30,182 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:30,182 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 21:55:30,182 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:55:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 21:55:30,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:30,185 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:30,185 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 661572557, now seen corresponding path program 1 times [2018-01-20 21:55:30,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:30,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:30,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:30,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:30,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:30,282 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-20 21:55:30,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:30,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:55:30,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:55:30,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:55:30,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:55:30,303 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 21:55:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:30,406 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-01-20 21:55:30,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:55:30,407 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-20 21:55:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:30,416 INFO L225 Difference]: With dead ends: 72 [2018-01-20 21:55:30,416 INFO L226 Difference]: Without dead ends: 41 [2018-01-20 21:55:30,419 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-20 21:55:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-20 21:55:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-20 21:55:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 21:55:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 21:55:30,460 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-01-20 21:55:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:30,460 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 21:55:30,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:55:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 21:55:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 21:55:30,461 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:30,461 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:30,461 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -853617319, now seen corresponding path program 1 times [2018-01-20 21:55:30,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:30,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:30,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:30,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:30,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:30,595 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-20 21:55:30,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:30,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 21:55:30,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 21:55:30,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 21:55:30,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 21:55:30,599 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-20 21:55:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:30,714 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-01-20 21:55:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:55:30,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-20 21:55:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:30,719 INFO L225 Difference]: With dead ends: 66 [2018-01-20 21:55:30,719 INFO L226 Difference]: Without dead ends: 53 [2018-01-20 21:55:30,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:55:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-20 21:55:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-01-20 21:55:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 21:55:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 21:55:30,727 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 30 [2018-01-20 21:55:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:30,727 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 21:55:30,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 21:55:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 21:55:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 21:55:30,729 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:30,729 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:30,729 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 167900261, now seen corresponding path program 1 times [2018-01-20 21:55:30,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:30,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:30,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:30,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:30,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:30,789 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-20 21:55:30,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:30,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:55:30,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:55:30,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:55:30,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:55:30,790 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-01-20 21:55:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:30,813 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-01-20 21:55:30,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:55:30,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-20 21:55:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:30,817 INFO L225 Difference]: With dead ends: 76 [2018-01-20 21:55:30,817 INFO L226 Difference]: Without dead ends: 51 [2018-01-20 21:55:30,818 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-20 21:55:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-20 21:55:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-01-20 21:55:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-20 21:55:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-20 21:55:30,825 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 36 [2018-01-20 21:55:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:30,825 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-20 21:55:30,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:55:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-20 21:55:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 21:55:30,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:30,827 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:30,827 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 562606371, now seen corresponding path program 1 times [2018-01-20 21:55:30,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:30,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:30,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:30,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:30,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:30,926 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-20 21:55:30,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:55:30,927 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-20 21:55:30,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:30,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:55:31,014 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-20 21:55:31,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:55:31,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-20 21:55:31,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 21:55:31,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 21:55:31,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-20 21:55:31,040 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 7 states. [2018-01-20 21:55:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:31,166 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2018-01-20 21:55:31,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 21:55:31,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-20 21:55:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:31,168 INFO L225 Difference]: With dead ends: 93 [2018-01-20 21:55:31,168 INFO L226 Difference]: Without dead ends: 51 [2018-01-20 21:55:31,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 21:55:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-20 21:55:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-01-20 21:55:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-20 21:55:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-20 21:55:31,175 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 39 [2018-01-20 21:55:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:31,175 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-20 21:55:31,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 21:55:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-20 21:55:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-20 21:55:31,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:31,177 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-20 21:55:31,177 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 21:55:31,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1644277160, now seen corresponding path program 1 times [2018-01-20 21:55:31,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:31,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:31,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:31,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 21:55:31,239 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 21:55:31,252 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:31,262 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:31,264 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:31,265 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 21:55:31,284 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:31,284 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:31,285 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:31,285 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:31,285 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:31,285 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:31,285 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:31,285 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == diffErr0EnsuresViolation======== [2018-01-20 21:55:31,285 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:55:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 21:55:31,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:31,288 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:31,288 INFO L371 AbstractCegarLoop]: === Iteration 1 === [diffErr0EnsuresViolation]=== [2018-01-20 21:55:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash -20991072, now seen corresponding path program 1 times [2018-01-20 21:55:31,288 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:31,288 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:31,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:31,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:31,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:31,312 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-20 21:55:31,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:31,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:55:31,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:55:31,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:55:31,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:55:31,314 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 21:55:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:31,318 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-01-20 21:55:31,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:55:31,318 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 21:55:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:31,319 INFO L225 Difference]: With dead ends: 72 [2018-01-20 21:55:31,319 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:55:31,319 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-20 21:55:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:55:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:55:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:55:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:55:31,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-20 21:55:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:31,320 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:55:31,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:55:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:55:31,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:55:31,323 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 21:55:31,323 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 21:55:31,323 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 21:55:31,323 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 21:55:31,323 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 21:55:31,323 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 21:55:31,323 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 21:55:31,323 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 21:55:31,323 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 21:55:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-20 21:55:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 21:55:31,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:31,325 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:31,325 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:31,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1073312926, now seen corresponding path program 1 times [2018-01-20 21:55:31,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:31,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:31,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:31,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:31,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:31,348 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-20 21:55:31,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:31,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 21:55:31,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 21:55:31,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 21:55:31,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 21:55:31,350 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-20 21:55:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:31,354 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-01-20 21:55:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 21:55:31,354 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-20 21:55:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:31,355 INFO L225 Difference]: With dead ends: 72 [2018-01-20 21:55:31,355 INFO L226 Difference]: Without dead ends: 39 [2018-01-20 21:55:31,356 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-20 21:55:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-20 21:55:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-20 21:55:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-20 21:55:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-01-20 21:55:31,359 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2018-01-20 21:55:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:31,360 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-01-20 21:55:31,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 21:55:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-01-20 21:55:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 21:55:31,360 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:31,360 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:31,360 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash 821457194, now seen corresponding path program 1 times [2018-01-20 21:55:31,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:31,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:31,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:31,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:31,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:31,469 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-20 21:55:31,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:31,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 21:55:31,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 21:55:31,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 21:55:31,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 21:55:31,470 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-01-20 21:55:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:31,522 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-01-20 21:55:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 21:55:31,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-20 21:55:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:31,527 INFO L225 Difference]: With dead ends: 62 [2018-01-20 21:55:31,527 INFO L226 Difference]: Without dead ends: 51 [2018-01-20 21:55:31,527 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 21:55:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-20 21:55:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-01-20 21:55:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 21:55:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 21:55:31,534 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 28 [2018-01-20 21:55:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:31,535 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 21:55:31,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 21:55:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 21:55:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 21:55:31,539 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:31,539 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:31,539 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash -840047818, now seen corresponding path program 1 times [2018-01-20 21:55:31,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:31,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:31,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:31,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:31,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:31,587 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-20 21:55:31,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:31,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 21:55:31,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 21:55:31,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 21:55:31,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 21:55:31,588 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-01-20 21:55:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:31,606 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-01-20 21:55:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 21:55:31,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-20 21:55:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:31,608 INFO L225 Difference]: With dead ends: 72 [2018-01-20 21:55:31,608 INFO L226 Difference]: Without dead ends: 49 [2018-01-20 21:55:31,609 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-20 21:55:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-20 21:55:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-01-20 21:55:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-20 21:55:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-01-20 21:55:31,615 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 34 [2018-01-20 21:55:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:31,615 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-01-20 21:55:31,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 21:55:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-01-20 21:55:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 21:55:31,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:31,617 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 21:55:31,617 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash -187123852, now seen corresponding path program 1 times [2018-01-20 21:55:31,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:31,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:31,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:31,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:31,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:31,732 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-20 21:55:31,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 21:55:31,732 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) [2018-01-20 21:55:31,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 21:55:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:31,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 21:55:31,808 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-20 21:55:31,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 21:55:31,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-01-20 21:55:31,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 21:55:31,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 21:55:31,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-20 21:55:31,830 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 7 states. [2018-01-20 21:55:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:31,958 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2018-01-20 21:55:31,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 21:55:31,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-20 21:55:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:31,960 INFO L225 Difference]: With dead ends: 89 [2018-01-20 21:55:31,960 INFO L226 Difference]: Without dead ends: 49 [2018-01-20 21:55:31,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 21:55:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-20 21:55:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-20 21:55:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-20 21:55:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-20 21:55:31,966 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 37 [2018-01-20 21:55:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:31,967 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-20 21:55:31,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 21:55:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-20 21:55:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 21:55:31,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 21:55:31,968 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-20 21:55:31,968 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 21:55:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash -247520791, now seen corresponding path program 1 times [2018-01-20 21:55:31,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 21:55:31,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 21:55:31,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 21:55:31,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 21:55:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 21:55:31,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 21:55:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 21:55:32,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 21:55:32,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-20 21:55:32,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 21:55:32,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 21:55:32,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-20 21:55:32,397 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 10 states. [2018-01-20 21:55:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 21:55:32,664 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-01-20 21:55:32,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-20 21:55:32,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-20 21:55:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 21:55:32,665 INFO L225 Difference]: With dead ends: 78 [2018-01-20 21:55:32,665 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 21:55:32,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-20 21:55:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 21:55:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 21:55:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 21:55:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 21:55:32,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-01-20 21:55:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 21:55:32,666 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 21:55:32,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 21:55:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 21:55:32,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 21:55:32,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 09:55:32 BoogieIcfgContainer [2018-01-20 21:55:32,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 21:55:32,671 INFO L168 Benchmark]: Toolchain (without parser) took 3251.81 ms. Allocated memory was 305.7 MB in the beginning and 481.8 MB in the end (delta: 176.2 MB). Free memory was 263.6 MB in the beginning and 319.8 MB in the end (delta: -56.3 MB). Peak memory consumption was 119.9 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:32,672 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 305.7 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 21:55:32,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.15 ms. Allocated memory is still 305.7 MB. Free memory was 262.6 MB in the beginning and 252.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:32,672 INFO L168 Benchmark]: Boogie Preprocessor took 38.76 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:32,672 INFO L168 Benchmark]: RCFGBuilder took 281.38 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 232.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:32,673 INFO L168 Benchmark]: TraceAbstraction took 2707.17 ms. Allocated memory was 305.7 MB in the beginning and 481.8 MB in the end (delta: 176.2 MB). Free memory was 232.5 MB in the beginning and 319.8 MB in the end (delta: -87.4 MB). Peak memory consumption was 88.8 MB. Max. memory is 5.3 GB. [2018-01-20 21:55:32,674 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 305.7 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.15 ms. Allocated memory is still 305.7 MB. Free memory was 262.6 MB in the beginning and 252.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.76 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 281.38 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 232.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2707.17 ms. Allocated memory was 305.7 MB in the beginning and 481.8 MB in the end (delta: 176.2 MB). Free memory was 232.5 MB in the beginning and 319.8 MB in the end (delta: -87.4 MB). Peak memory consumption was 88.8 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) - 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 4 procedures, 45 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L565] int Alen = __VERIFIER_nondet_int(); [L566] int Blen = __VERIFIER_nondet_int(); [L567] COND TRUE Alen < 1 || Alen >= 2147483647 / sizeof(int) [L568] Alen = 1 VAL [Alen=1, Blen=1] [L570] COND FALSE !(Blen < 1 || Blen >= 2147483647 / sizeof(int)) VAL [Alen=1, Blen=1] [L573] EXPR, FCALL __builtin_alloca (Alen * sizeof(int)) VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, Alen=1, Blen=1] [L573] int* A = (int*) __builtin_alloca (Alen * sizeof(int)); VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, A={536870916:0}, Alen=1, Blen=1] [L574] EXPR, FCALL __builtin_alloca (Blen * sizeof(int)) VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, Blen=1] [L574] int* B = (int*) __builtin_alloca (Blen * sizeof(int)); VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, B={536870919:0}, Blen=1] [L575] EXPR, FCALL __builtin_alloca (Alen * sizeof(int)) VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Alen * sizeof(int))={536870917:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, B={536870919:0}, Blen=1] [L575] int* D = (int*) __builtin_alloca (Alen * sizeof(int)); VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Alen * sizeof(int))={536870917:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, B={536870919:0}, Blen=1, D={536870917:0}] [L576] CALL diff(A, Alen, B, Blen, D) VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, B={536870919:0}, D={536870917:0}] [L542] int k = 0; [L543] int i = 0; [L544] int l1 = Alen; [L545] int l2 = Blen; [L546] int found; VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, i=0, k=0, l1=1, l2=1] [L547] COND TRUE i < l1 [L548] int j = 0; [L549] found = 0 VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=0, i=0, j=0, k=0, l1=1, l2=1] [L550] COND TRUE j < l2 && !found VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=0, i=0, j=0, k=0, l1=1, l2=1] [L551] EXPR, FCALL A[i] VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, A[i]=536870915, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=0, i=0, j=0, k=0, l1=1, l2=1] [L551] EXPR, FCALL B[j] VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, A[i]=536870915, Alen=1, B={536870919:0}, B={536870919:0}, B[j]=536870915, Blen=1, D={536870917:0}, D={536870917:0}, found=0, i=0, j=0, k=0, l1=1, l2=1] [L551] COND TRUE A[i] == B[j] [L552] found = 1 VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=0, j=0, k=0, l1=1, l2=1] [L550] COND FALSE !(j < l2 && !found) VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=0, j=0, k=0, l1=1, l2=1] [L557] COND FALSE !(!found) VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=0, j=0, k=0, l1=1, l2=1] [L561] i++ VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=1, j=0, k=0, l1=1, l2=1] [L547] COND FALSE, RET !(i < l1) VAL [\old(Alen)=1, \old(Blen)=1, A={536870916:0}, A={536870916:0}, Alen=1, B={536870919:0}, B={536870919:0}, Blen=1, D={536870917:0}, D={536870917:0}, found=1, i=1, j=0, k=0, l1=1, l2=1] [L576] diff(A, Alen, B, Blen, D) VAL [__builtin_alloca (Alen * sizeof(int))={536870916:0}, __builtin_alloca (Alen * sizeof(int))={536870917:0}, __builtin_alloca (Blen * sizeof(int))={536870919:0}, A={536870916:0}, Alen=1, B={536870919:0}, Blen=1, D={536870917:0}] [L577] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. UNSAFE Result, 1.1s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 100 SDslu, 257 SDs, 0 SdLazy, 98 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, 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, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 10980 SizeOfPredicates, 5 NumberOfNonLiveVariables, 148 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: diffErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 45 locations, 4 error locations. SAFE Result, 1.3s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 203 SDtfs, 133 SDslu, 353 SDs, 0 SdLazy, 354 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, 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, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 21512 SizeOfPredicates, 5 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 6/10 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/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_21-55-32-682.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_21-55-32-682.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_21-55-32-682.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_21-55-32-682.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_21-55-32-682.csv Received shutdown request...