java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-crafted/bor5.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:29:41,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:29:41,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:29:41,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:29:41,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:29:41,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:29:41,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:29:41,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:29:41,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:29:41,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:29:41,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:29:41,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:29:41,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:29:41,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:29:41,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:29:41,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:29:41,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:29:41,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:29:41,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:29:41,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:29:41,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:29:41,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:29:41,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:29:41,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:29:41,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:29:41,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:29:41,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:29:41,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:29:41,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:29:41,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:29:41,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:29:41,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:29:41,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:29:41,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:29:41,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:29:41,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:29:41,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:29:41,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:29:41,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:29:41,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:29:41,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:29:41,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:29:41,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:29:41,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:29:41,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:29:41,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:29:41,264 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:29:41,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:29:41,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:29:41,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:29:41,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:29:41,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:29:41,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:29:41,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:29:41,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:29:41,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:29:41,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:29:41,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:29:41,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:29:41,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:29:41,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:29:41,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:29:41,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:29:41,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:41,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:29:41,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:29:41,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:29:41,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:29:41,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:29:41,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:29:41,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:29:41,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:29:41,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:29:41,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:29:41,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:29:41,614 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:29:41,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bor5.i [2019-10-15 01:29:41,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa849416/97b027a2f32044e7b5c1f4f26adff535/FLAG1f68a77d4 [2019-10-15 01:29:42,151 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:29:42,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bor5.i [2019-10-15 01:29:42,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa849416/97b027a2f32044e7b5c1f4f26adff535/FLAG1f68a77d4 [2019-10-15 01:29:42,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa849416/97b027a2f32044e7b5c1f4f26adff535 [2019-10-15 01:29:42,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:29:42,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:29:42,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:29:42,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:29:42,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510c1389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42, skipping insertion in model container [2019-10-15 01:29:42,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,590 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:29:42,610 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:29:42,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,867 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:29:42,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:43,014 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:29:43,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43 WrapperNode [2019-10-15 01:29:43,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:43,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:29:43,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:29:43,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:29:43,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (1/1) ... [2019-10-15 01:29:43,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (1/1) ... [2019-10-15 01:29:43,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (1/1) ... [2019-10-15 01:29:43,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (1/1) ... [2019-10-15 01:29:43,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (1/1) ... [2019-10-15 01:29:43,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (1/1) ... [2019-10-15 01:29:43,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (1/1) ... [2019-10-15 01:29:43,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:29:43,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:29:43,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:29:43,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:29:43,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-15 01:29:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:29:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:29:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2019-10-15 01:29:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:29:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:29:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:29:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2019-10-15 01:29:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:29:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:29:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:29:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:29:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:29:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:29:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:29:43,549 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:29:43,550 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:29:43,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:43 BoogieIcfgContainer [2019-10-15 01:29:43,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:29:43,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:29:43,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:29:43,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:29:43,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:29:42" (1/3) ... [2019-10-15 01:29:43,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c105422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:43, skipping insertion in model container [2019-10-15 01:29:43,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:43" (2/3) ... [2019-10-15 01:29:43,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c105422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:43, skipping insertion in model container [2019-10-15 01:29:43,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:43" (3/3) ... [2019-10-15 01:29:43,559 INFO L109 eAbstractionObserver]: Analyzing ICFG bor5.i [2019-10-15 01:29:43,569 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:29:43,576 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:29:43,588 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:29:43,613 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:29:43,614 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:29:43,614 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:29:43,614 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:29:43,614 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:29:43,614 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:29:43,615 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:29:43,615 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:29:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-15 01:29:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:29:43,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,640 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:43,642 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:43,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1917444957, now seen corresponding path program 1 times [2019-10-15 01:29:43,658 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:43,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126398444] [2019-10-15 01:29:43,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:43,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126398444] [2019-10-15 01:29:43,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:43,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:43,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042164834] [2019-10-15 01:29:43,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:43,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:43,950 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-15 01:29:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:44,006 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-15 01:29:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:44,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:29:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,016 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:29:44,017 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 01:29:44,021 INFO L600 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 [2019-10-15 01:29:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 01:29:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 01:29:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 01:29:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 01:29:44,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 01:29:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,068 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 01:29:44,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 01:29:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:29:44,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,071 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:44,072 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash 826826161, now seen corresponding path program 1 times [2019-10-15 01:29:44,073 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137906241] [2019-10-15 01:29:44,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:44,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137906241] [2019-10-15 01:29:44,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165930171] [2019-10-15 01:29:44,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:29:44,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:44,398 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:44,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592816035] [2019-10-15 01:29:44,484 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-15 01:29:44,485 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:44,493 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:44,503 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:44,503 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:44,750 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:29:46,617 INFO L199 IcfgInterpreter]: Interpreting procedure bor with input of size 1 for LOIs [2019-10-15 01:29:46,623 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:29:46,628 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:47,553 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-15 01:29:47,714 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-15 01:29:47,717 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:47,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 17] total 25 [2019-10-15 01:29:47,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682685434] [2019-10-15 01:29:47,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 01:29:47,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 01:29:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:29:47,722 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 25 states. [2019-10-15 01:29:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:47,996 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-10-15 01:29:47,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:29:47,997 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-10-15 01:29:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:47,998 INFO L225 Difference]: With dead ends: 36 [2019-10-15 01:29:47,998 INFO L226 Difference]: Without dead ends: 23 [2019-10-15 01:29:48,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2019-10-15 01:29:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-15 01:29:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-15 01:29:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-15 01:29:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-15 01:29:48,006 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2019-10-15 01:29:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:48,007 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-15 01:29:48,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 01:29:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-15 01:29:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:29:48,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:48,008 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:48,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:48,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash 304486889, now seen corresponding path program 1 times [2019-10-15 01:29:48,214 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:48,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445642652] [2019-10-15 01:29:48,215 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,215 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:29:48,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445642652] [2019-10-15 01:29:48,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:48,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:48,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113058735] [2019-10-15 01:29:48,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:48,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:48,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:48,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:48,308 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-10-15 01:29:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:48,344 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-10-15 01:29:48,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:48,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-15 01:29:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:48,360 INFO L225 Difference]: With dead ends: 33 [2019-10-15 01:29:48,360 INFO L226 Difference]: Without dead ends: 24 [2019-10-15 01:29:48,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-15 01:29:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-15 01:29:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 01:29:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-10-15 01:29:48,374 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2019-10-15 01:29:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:48,376 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-15 01:29:48,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-10-15 01:29:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:29:48,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:48,381 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:48,382 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash 114650706, now seen corresponding path program 1 times [2019-10-15 01:29:48,383 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:48,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063472298] [2019-10-15 01:29:48,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:29:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:29:48,593 INFO L168 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-10-15 01:29:48,593 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-15 01:29:48,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:29:48 BoogieIcfgContainer [2019-10-15 01:29:48,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:29:48,681 INFO L168 Benchmark]: Toolchain (without parser) took 6105.65 ms. Allocated memory was 134.7 MB in the beginning and 302.0 MB in the end (delta: 167.2 MB). Free memory was 99.7 MB in the beginning and 256.5 MB in the end (delta: -156.8 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:29:48,681 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 118.0 MB in the beginning and 117.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:29:48,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.23 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 177.9 MB in the end (delta: -78.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:29:48,686 INFO L168 Benchmark]: Boogie Preprocessor took 55.55 ms. Allocated memory is still 198.7 MB. Free memory was 177.9 MB in the beginning and 175.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:29:48,687 INFO L168 Benchmark]: RCFGBuilder took 479.30 ms. Allocated memory is still 198.7 MB. Free memory was 175.3 MB in the beginning and 153.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:29:48,690 INFO L168 Benchmark]: TraceAbstraction took 5124.30 ms. Allocated memory was 198.7 MB in the beginning and 302.0 MB in the end (delta: 103.3 MB). Free memory was 153.8 MB in the beginning and 256.5 MB in the end (delta: -102.7 MB). Peak memory consumption was 619.5 kB. Max. memory is 7.1 GB. [2019-10-15 01:29:48,698 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 118.0 MB in the beginning and 117.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 440.23 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 177.9 MB in the end (delta: -78.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.55 ms. Allocated memory is still 198.7 MB. Free memory was 177.9 MB in the beginning and 175.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 479.30 ms. Allocated memory is still 198.7 MB. Free memory was 175.3 MB in the beginning and 153.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5124.30 ms. Allocated memory was 198.7 MB in the beginning and 302.0 MB in the end (delta: 103.3 MB). Free memory was 153.8 MB in the beginning and 256.5 MB in the end (delta: -102.7 MB). Peak memory consumption was 619.5 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 14. Possible FailurePath: [L6] int N; [L21] N = __VERIFIER_nondet_int() [L22] COND TRUE N > 1 [L23] int x[N]; [L24] int temp; [L25] int ret; [L26] int ret2; [L27] int ret5; [L29] int i = 0; VAL [\old(N)=0, i=0, N=2, x={1:0}] [L29] COND TRUE i < N [L31] x[i] = __VERIFIER_nondet_int() [L29] i++ VAL [\old(N)=0, i=1, N=2, x={1:0}] [L29] COND TRUE i < N [L31] x[i] = __VERIFIER_nondet_int() [L29] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}] [L29] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={1:0}] [L34] CALL, EXPR bor(x) VAL [\old(N)=0, N=2, x={1:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=0, x={1:0}, x={1:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res | x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}] [L13] COND FALSE !(i < N) [L16] return res; [L34] RET, EXPR bor(x) VAL [\old(N)=0, bor(x)=0, i=2, N=2, x={1:0}] [L34] ret = bor(x) [L36] EXPR x[0] [L36] temp=x[0] [L36] EXPR x[1] [L36] x[0] = x[1] [L36] x[1] = temp VAL [\old(N)=0, i=2, N=2, ret=0, temp=0, x={1:0}] [L37] CALL, EXPR bor(x) VAL [\old(N)=0, N=2, x={1:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=1, x={1:0}, x={1:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res | x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}] [L13] COND FALSE !(i < N) [L16] return res; [L37] RET, EXPR bor(x) VAL [\old(N)=0, bor(x)=-2, i=2, N=2, ret=0, temp=0, x={1:0}] [L37] ret2 = bor(x) [L38] EXPR x[0] [L38] temp=x[0] [L39] int i =0 ; VAL [\old(N)=0, i=2, i=0, N=2, ret=0, ret2=-2, temp=1, x={1:0}] [L39] COND TRUE i