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/eca-rers2012/Problem01_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:40:45,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:40:45,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:40:45,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:40:45,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:40:45,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:40:45,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:40:45,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:40:45,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:40:45,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:40:45,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:40:45,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:40:45,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:40:45,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:40:45,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:40:45,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:40:45,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:40:45,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:40:45,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:40:45,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:40:45,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:40:45,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:40:45,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:40:45,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:40:45,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:40:45,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:40:45,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:40:45,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:40:45,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:40:45,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:40:45,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:40:45,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:40:45,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:40:45,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:40:45,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:40:45,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:40:45,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:40:45,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:40:45,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:40:45,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:40:45,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:40:45,219 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-13 21:40:45,240 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:40:45,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:40:45,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:40:45,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:40:45,243 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:40:45,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:40:45,244 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:40:45,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:40:45,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:40:45,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:40:45,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:40:45,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:40:45,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:40:45,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:40:45,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:40:45,247 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:40:45,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:40:45,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:40:45,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:40:45,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:40:45,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:40:45,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:40:45,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:40:45,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:40:45,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:40:45,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:40:45,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:40:45,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:40:45,250 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-13 21:40:45,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:40:45,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:40:45,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:40:45,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:40:45,596 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:40:45,597 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label54.c [2019-10-13 21:40:45,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb935f29/e4f6719d1bc94851be7a9004e33c8fed/FLAG168e2e19c [2019-10-13 21:40:46,279 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:40:46,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label54.c [2019-10-13 21:40:46,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb935f29/e4f6719d1bc94851be7a9004e33c8fed/FLAG168e2e19c [2019-10-13 21:40:46,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb935f29/e4f6719d1bc94851be7a9004e33c8fed [2019-10-13 21:40:46,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:40:46,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:40:46,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:46,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:40:46,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:40:46,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:46" (1/1) ... [2019-10-13 21:40:46,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ba53ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:46, skipping insertion in model container [2019-10-13 21:40:46,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:46" (1/1) ... [2019-10-13 21:40:46,519 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:40:46,586 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:40:47,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:47,139 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:40:47,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:47,289 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:40:47,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47 WrapperNode [2019-10-13 21:40:47,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:47,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:40:47,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:40:47,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:40:47,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (1/1) ... [2019-10-13 21:40:47,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (1/1) ... [2019-10-13 21:40:47,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (1/1) ... [2019-10-13 21:40:47,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (1/1) ... [2019-10-13 21:40:47,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (1/1) ... [2019-10-13 21:40:47,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (1/1) ... [2019-10-13 21:40:47,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (1/1) ... [2019-10-13 21:40:47,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:40:47,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:40:47,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:40:47,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:40:47,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (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-13 21:40:47,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:40:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:40:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:40:47,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:40:47,504 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:40:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:40:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:40:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:40:47,505 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:40:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:40:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:40:49,511 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:40:49,512 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:40:49,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:49 BoogieIcfgContainer [2019-10-13 21:40:49,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:40:49,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:40:49,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:40:49,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:40:49,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:40:46" (1/3) ... [2019-10-13 21:40:49,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dd56e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:49, skipping insertion in model container [2019-10-13 21:40:49,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:47" (2/3) ... [2019-10-13 21:40:49,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dd56e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:49, skipping insertion in model container [2019-10-13 21:40:49,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:49" (3/3) ... [2019-10-13 21:40:49,532 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label54.c [2019-10-13 21:40:49,547 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:40:49,557 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:40:49,569 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:40:49,612 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:40:49,613 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:40:49,613 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:40:49,613 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:40:49,613 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:40:49,613 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:40:49,614 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:40:49,614 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:40:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-13 21:40:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:40:49,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:49,660 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:49,661 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:49,666 INFO L82 PathProgramCache]: Analyzing trace with hash 826824036, now seen corresponding path program 1 times [2019-10-13 21:40:49,673 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:49,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489731601] [2019-10-13 21:40:49,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:49,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:49,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:50,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489731601] [2019-10-13 21:40:50,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:50,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:50,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382702016] [2019-10-13 21:40:50,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:50,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:50,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:50,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:50,117 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-13 21:40:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:50,707 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-13 21:40:50,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:50,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-13 21:40:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:50,725 INFO L225 Difference]: With dead ends: 246 [2019-10-13 21:40:50,725 INFO L226 Difference]: Without dead ends: 157 [2019-10-13 21:40:50,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 21:40:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-13 21:40:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-13 21:40:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 21:40:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 291 transitions. [2019-10-13 21:40:50,853 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 291 transitions. Word has length 77 [2019-10-13 21:40:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:50,855 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 291 transitions. [2019-10-13 21:40:50,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 291 transitions. [2019-10-13 21:40:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:40:50,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:50,866 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:50,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:50,868 INFO L82 PathProgramCache]: Analyzing trace with hash 579798987, now seen corresponding path program 1 times [2019-10-13 21:40:50,869 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:50,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882403136] [2019-10-13 21:40:50,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:50,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:50,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:51,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882403136] [2019-10-13 21:40:51,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:51,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:51,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672533167] [2019-10-13 21:40:51,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:51,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:51,100 INFO L87 Difference]: Start difference. First operand 157 states and 291 transitions. Second operand 3 states. [2019-10-13 21:40:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:51,528 INFO L93 Difference]: Finished difference Result 459 states and 874 transitions. [2019-10-13 21:40:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:51,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-13 21:40:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:51,533 INFO L225 Difference]: With dead ends: 459 [2019-10-13 21:40:51,533 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 21:40:51,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 21:40:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 21:40:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 232. [2019-10-13 21:40:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 21:40:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 412 transitions. [2019-10-13 21:40:51,556 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 412 transitions. Word has length 94 [2019-10-13 21:40:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:51,558 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 412 transitions. [2019-10-13 21:40:51,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 412 transitions. [2019-10-13 21:40:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:40:51,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:51,562 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-10-13 21:40:51,563 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:51,564 INFO L82 PathProgramCache]: Analyzing trace with hash 95155127, now seen corresponding path program 1 times [2019-10-13 21:40:51,564 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:51,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598956452] [2019-10-13 21:40:51,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:51,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:51,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:51,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598956452] [2019-10-13 21:40:51,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:51,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:51,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768247438] [2019-10-13 21:40:51,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:51,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:51,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:51,808 INFO L87 Difference]: Start difference. First operand 232 states and 412 transitions. Second operand 6 states. [2019-10-13 21:40:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:52,419 INFO L93 Difference]: Finished difference Result 635 states and 1153 transitions. [2019-10-13 21:40:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:52,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-13 21:40:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:52,426 INFO L225 Difference]: With dead ends: 635 [2019-10-13 21:40:52,426 INFO L226 Difference]: Without dead ends: 408 [2019-10-13 21:40:52,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:40:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-10-13 21:40:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 396. [2019-10-13 21:40:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-13 21:40:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 651 transitions. [2019-10-13 21:40:52,503 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 651 transitions. Word has length 121 [2019-10-13 21:40:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:52,504 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 651 transitions. [2019-10-13 21:40:52,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 651 transitions. [2019-10-13 21:40:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:40:52,516 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:52,516 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:52,516 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash -67994930, now seen corresponding path program 1 times [2019-10-13 21:40:52,517 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:52,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717099668] [2019-10-13 21:40:52,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:52,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:52,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:40:52,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717099668] [2019-10-13 21:40:52,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980341463] [2019-10-13 21:40:52,714 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-13 21:40:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:52,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:40:52,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:40:52,946 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:40:53,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:40:53,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-13 21:40:53,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929835748] [2019-10-13 21:40:53,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:40:53,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:53,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:40:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:40:53,044 INFO L87 Difference]: Start difference. First operand 396 states and 651 transitions. Second operand 5 states. [2019-10-13 21:40:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:53,709 INFO L93 Difference]: Finished difference Result 1050 states and 1807 transitions. [2019-10-13 21:40:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:53,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-10-13 21:40:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:53,715 INFO L225 Difference]: With dead ends: 1050 [2019-10-13 21:40:53,715 INFO L226 Difference]: Without dead ends: 659 [2019-10-13 21:40:53,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:40:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-13 21:40:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 556. [2019-10-13 21:40:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-13 21:40:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 891 transitions. [2019-10-13 21:40:53,763 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 891 transitions. Word has length 131 [2019-10-13 21:40:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:53,764 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 891 transitions. [2019-10-13 21:40:53,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:40:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 891 transitions. [2019-10-13 21:40:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:40:53,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:53,767 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:53,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:53,988 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1205364438, now seen corresponding path program 1 times [2019-10-13 21:40:53,989 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:53,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937641584] [2019-10-13 21:40:53,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:53,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:53,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:54,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937641584] [2019-10-13 21:40:54,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827356726] [2019-10-13 21:40:54,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:54,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:40:54,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:54,309 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:40:54,356 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:40:54,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:40:54,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201265173] [2019-10-13 21:40:54,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:54,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:54,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:54,358 INFO L87 Difference]: Start difference. First operand 556 states and 891 transitions. Second operand 3 states. [2019-10-13 21:40:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:54,814 INFO L93 Difference]: Finished difference Result 1411 states and 2345 transitions. [2019-10-13 21:40:54,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:54,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-13 21:40:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:54,819 INFO L225 Difference]: With dead ends: 1411 [2019-10-13 21:40:54,819 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:40:54,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:40:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:40:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:40:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:40:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:40:54,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2019-10-13 21:40:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:54,824 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:40:54,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:40:54,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:40:55,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:55,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:40:55,344 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-10-13 21:40:55,447 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a16~0 |old(~a16~0)|) (= ~a7~0 |old(~a7~0)|)) [2019-10-13 21:40:55,448 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:55,448 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-13 21:40:55,448 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-13 21:40:55,448 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-13 21:40:55,448 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-13 21:40:55,449 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-13 21:40:55,449 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-13 21:40:55,449 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-13 21:40:55,449 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-13 21:40:55,449 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-13 21:40:55,449 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-13 21:40:55,449 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-13 21:40:55,450 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-13 21:40:55,450 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-13 21:40:55,450 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-13 21:40:55,450 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:55,450 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-13 21:40:55,450 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-13 21:40:55,450 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-13 21:40:55,451 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:55,451 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-13 21:40:55,451 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-13 21:40:55,451 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-13 21:40:55,451 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-13 21:40:55,451 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-13 21:40:55,451 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-13 21:40:55,452 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-13 21:40:55,452 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-13 21:40:55,452 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-13 21:40:55,452 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2019-10-13 21:40:55,452 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-13 21:40:55,452 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-13 21:40:55,453 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-13 21:40:55,454 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-13 21:40:55,454 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-13 21:40:55,454 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-13 21:40:55,454 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-13 21:40:55,454 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-13 21:40:55,454 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-13 21:40:55,454 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-13 21:40:55,455 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-13 21:40:55,455 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-13 21:40:55,455 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-13 21:40:55,455 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-13 21:40:55,455 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-13 21:40:55,455 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse3 (<= ~a16~0 |old(~a16~0)|)) (.cse4 (= ~a7~0 |old(~a7~0)|))) (let ((.cse1 (= 14 |old(~a8~0)|)) (.cse0 (and .cse3 .cse4 (not (= 14 ~a8~0)))) (.cse2 (= 1 |old(~a7~0)|))) (and (or .cse0 (not (<= |old(~a16~0)| 5)) .cse1) (or .cse2 .cse1 .cse0) (or .cse2 (not (<= |old(~a16~0)| 4)) (and .cse3 .cse4)) (or (= 1 |old(~a17~0)|) (and .cse3 .cse4 (not (= ~a17~0 1))))))) [2019-10-13 21:40:55,456 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-13 21:40:55,456 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-13 21:40:55,456 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-13 21:40:55,456 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-13 21:40:55,456 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-13 21:40:55,456 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-13 21:40:55,456 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-13 21:40:55,457 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-13 21:40:55,457 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-13 21:40:55,457 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-13 21:40:55,457 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-13 21:40:55,457 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-13 21:40:55,457 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-13 21:40:55,457 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-13 21:40:55,458 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-13 21:40:55,458 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-13 21:40:55,458 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-13 21:40:55,458 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-13 21:40:55,458 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-13 21:40:55,458 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-13 21:40:55,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:40:55,458 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a7~0 1)) (<= ~a16~0 5) (not (= 14 ~a8~0))) [2019-10-13 21:40:55,458 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:40:55,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:40:55,459 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 1 |old(~a7~0)|) (not (<= |old(~a16~0)| 5)) (= 14 |old(~a8~0)|) (and (<= ~a16~0 |old(~a16~0)|) (= ~a7~0 |old(~a7~0)|) (not (= 14 ~a8~0)))) [2019-10-13 21:40:55,459 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:55,459 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (not (= ~a7~0 1))) (.cse1 (not (= 14 ~a8~0)))) (or (= 1 |old(~a7~0)|) (not (<= |old(~a16~0)| 5)) (and .cse0 .cse1) (= 14 |old(~a8~0)|) (and .cse0 (<= ~a16~0 4)) (and (<= ~a16~0 5) .cse1) (not (= ~a17~0 1)))) [2019-10-13 21:40:55,459 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-13 21:40:55,459 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-13 21:40:55,459 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a7~0 1))) (.cse1 (not (= 14 ~a8~0)))) (or (= 1 |old(~a7~0)|) (not (<= |old(~a16~0)| 5)) (and .cse0 .cse1) (= 14 |old(~a8~0)|) (and .cse0 (<= ~a16~0 4)) (and (<= ~a16~0 5) .cse1) (not (= ~a17~0 1)))) [2019-10-13 21:40:55,459 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-13 21:40:55,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:40:55 BoogieIcfgContainer [2019-10-13 21:40:55,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:40:55,478 INFO L168 Benchmark]: Toolchain (without parser) took 8976.40 ms. Allocated memory was 141.6 MB in the beginning and 314.0 MB in the end (delta: 172.5 MB). Free memory was 104.8 MB in the beginning and 194.0 MB in the end (delta: -89.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:55,479 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.6 MB. Free memory was 124.8 MB in the beginning and 124.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:40:55,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.37 ms. Allocated memory was 141.6 MB in the beginning and 207.1 MB in the end (delta: 65.5 MB). Free memory was 104.6 MB in the beginning and 173.6 MB in the end (delta: -69.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:55,481 INFO L168 Benchmark]: Boogie Preprocessor took 127.27 ms. Allocated memory is still 207.1 MB. Free memory was 173.6 MB in the beginning and 168.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:55,482 INFO L168 Benchmark]: RCFGBuilder took 2095.84 ms. Allocated memory was 207.1 MB in the beginning and 246.9 MB in the end (delta: 39.8 MB). Free memory was 168.3 MB in the beginning and 192.4 MB in the end (delta: -24.1 MB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:55,483 INFO L168 Benchmark]: TraceAbstraction took 5959.45 ms. Allocated memory was 246.9 MB in the beginning and 314.0 MB in the end (delta: 67.1 MB). Free memory was 192.4 MB in the beginning and 194.0 MB in the end (delta: -1.6 MB). Peak memory consumption was 65.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:55,487 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.22 ms. Allocated memory is still 141.6 MB. Free memory was 124.8 MB in the beginning and 124.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.37 ms. Allocated memory was 141.6 MB in the beginning and 207.1 MB in the end (delta: 65.5 MB). Free memory was 104.6 MB in the beginning and 173.6 MB in the end (delta: -69.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.27 ms. Allocated memory is still 207.1 MB. Free memory was 173.6 MB in the beginning and 168.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2095.84 ms. Allocated memory was 207.1 MB in the beginning and 246.9 MB in the end (delta: 39.8 MB). Free memory was 168.3 MB in the beginning and 192.4 MB in the end (delta: -24.1 MB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5959.45 ms. Allocated memory was 246.9 MB in the beginning and 314.0 MB in the end (delta: 67.1 MB). Free memory was 192.4 MB in the beginning and 194.0 MB in the end (delta: -1.6 MB). Peak memory consumption was 65.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((1 == \old(a7) || !(\old(a16) <= 5)) || (!(a7 == 1) && !(14 == a8))) || 14 == \old(a8)) || (!(a7 == 1) && a16 <= 4)) || (a16 <= 5 && !(14 == a8))) || !(a17 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 349 SDtfs, 611 SDslu, 98 SDs, 0 SdLazy, 1449 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 529 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 190 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 35 PreInvPairs, 57 NumberOfFragments, 190 HoareAnnotationTreeSize, 35 FomulaSimplifications, 1130 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 309 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 285360 SizeOfPredicates, 3 NumberOfNonLiveVariables, 945 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 395/409 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...