/usr/bin/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/Problem02_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:38:32,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:38:32,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:38:32,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:38:32,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:38:32,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:38:32,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:38:32,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:38:32,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:38:32,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:38:32,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:38:32,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:38:32,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:38:32,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:38:32,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:38:32,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:38:32,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:38:32,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:38:32,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:38:32,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:38:32,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:38:32,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:38:32,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:38:32,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:38:32,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:38:32,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:38:32,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:38:32,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:38:32,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:38:32,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:38:32,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:38:32,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:38:32,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:38:32,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:38:32,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:38:32,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:38:32,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:38:32,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:38:32,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:38:32,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:38:32,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:38:32,156 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-11-07 01:38:32,171 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:38:32,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:38:32,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:38:32,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:38:32,173 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:38:32,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:38:32,174 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:38:32,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:38:32,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:38:32,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:38:32,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:38:32,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:38:32,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:38:32,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:38:32,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:38:32,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:38:32,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:38:32,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:38:32,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:38:32,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:38:32,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:38:32,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:38:32,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:38:32,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:38:32,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:38:32,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:38:32,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:38:32,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:38:32,179 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-11-07 01:38:32,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:38:32,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:38:32,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:38:32,534 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:38:32,534 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:38:32,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24.c [2019-11-07 01:38:32,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0f54249/94183fc830c646a59cc6f4cf527f2337/FLAG94a74ada6 [2019-11-07 01:38:33,117 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:38:33,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24.c [2019-11-07 01:38:33,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0f54249/94183fc830c646a59cc6f4cf527f2337/FLAG94a74ada6 [2019-11-07 01:38:33,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0f54249/94183fc830c646a59cc6f4cf527f2337 [2019-11-07 01:38:33,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:38:33,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:38:33,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:38:33,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:38:33,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:38:33,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:38:33" (1/1) ... [2019-11-07 01:38:33,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd62c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:33, skipping insertion in model container [2019-11-07 01:38:33,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:38:33" (1/1) ... [2019-11-07 01:38:33,393 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:38:33,457 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:38:33,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:38:33,935 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:38:34,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:38:34,247 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:38:34,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34 WrapperNode [2019-11-07 01:38:34,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:38:34,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:38:34,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:38:34,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:38:34,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (1/1) ... [2019-11-07 01:38:34,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (1/1) ... [2019-11-07 01:38:34,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (1/1) ... [2019-11-07 01:38:34,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (1/1) ... [2019-11-07 01:38:34,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (1/1) ... [2019-11-07 01:38:34,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (1/1) ... [2019-11-07 01:38:34,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (1/1) ... [2019-11-07 01:38:34,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:38:34,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:38:34,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:38:34,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:38:34,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (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-11-07 01:38:34,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:38:34,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:38:34,418 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-07 01:38:34,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:38:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-07 01:38:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:38:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:38:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 01:38:34,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:38:34,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:38:34,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:38:36,411 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:38:36,412 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:38:36,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:38:36 BoogieIcfgContainer [2019-11-07 01:38:36,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:38:36,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:38:36,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:38:36,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:38:36,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:38:33" (1/3) ... [2019-11-07 01:38:36,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e4a4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:38:36, skipping insertion in model container [2019-11-07 01:38:36,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:38:34" (2/3) ... [2019-11-07 01:38:36,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e4a4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:38:36, skipping insertion in model container [2019-11-07 01:38:36,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:38:36" (3/3) ... [2019-11-07 01:38:36,422 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label24.c [2019-11-07 01:38:36,432 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:38:36,440 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:38:36,452 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:38:36,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:38:36,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:38:36,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:38:36,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:38:36,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:38:36,479 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:38:36,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:38:36,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:38:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-11-07 01:38:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-07 01:38:36,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:38:36,510 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:38:36,512 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:38:36,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:38:36,518 INFO L82 PathProgramCache]: Analyzing trace with hash -219361993, now seen corresponding path program 1 times [2019-11-07 01:38:36,528 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:38:36,528 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190350649] [2019-11-07 01:38:36,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:38:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:38:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:38:36,914 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190350649] [2019-11-07 01:38:36,915 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:38:36,915 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:38:36,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175324728] [2019-11-07 01:38:36,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:38:36,923 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:38:36,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:38:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:38:36,940 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-11-07 01:38:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:38:37,663 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-11-07 01:38:37,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:38:37,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-07 01:38:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:38:37,679 INFO L225 Difference]: With dead ends: 273 [2019-11-07 01:38:37,679 INFO L226 Difference]: Without dead ends: 175 [2019-11-07 01:38:37,683 INFO L630 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-11-07 01:38:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-07 01:38:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-07 01:38:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-07 01:38:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 312 transitions. [2019-11-07 01:38:37,747 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 312 transitions. Word has length 86 [2019-11-07 01:38:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:38:37,748 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 312 transitions. [2019-11-07 01:38:37,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:38:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 312 transitions. [2019-11-07 01:38:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-07 01:38:37,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:38:37,754 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:38:37,754 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:38:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:38:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash -701896772, now seen corresponding path program 1 times [2019-11-07 01:38:37,755 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:38:37,755 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690437265] [2019-11-07 01:38:37,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:38:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:38:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:38:37,907 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690437265] [2019-11-07 01:38:37,908 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:38:37,908 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:38:37,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552475104] [2019-11-07 01:38:37,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:38:37,912 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:38:37,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:38:37,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:38:37,913 INFO L87 Difference]: Start difference. First operand 175 states and 312 transitions. Second operand 3 states. [2019-11-07 01:38:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:38:38,304 INFO L93 Difference]: Finished difference Result 513 states and 937 transitions. [2019-11-07 01:38:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:38:38,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-07 01:38:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:38:38,314 INFO L225 Difference]: With dead ends: 513 [2019-11-07 01:38:38,315 INFO L226 Difference]: Without dead ends: 343 [2019-11-07 01:38:38,317 INFO L630 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-11-07 01:38:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-07 01:38:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-11-07 01:38:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-07 01:38:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 515 transitions. [2019-11-07 01:38:38,372 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 515 transitions. Word has length 94 [2019-11-07 01:38:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:38:38,372 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 515 transitions. [2019-11-07 01:38:38,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:38:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 515 transitions. [2019-11-07 01:38:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:38:38,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:38:38,379 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:38:38,379 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:38:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:38:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1298849335, now seen corresponding path program 1 times [2019-11-07 01:38:38,385 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:38:38,385 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716174062] [2019-11-07 01:38:38,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:38:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:38:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:38:38,582 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716174062] [2019-11-07 01:38:38,582 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:38:38,583 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:38:38,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588271728] [2019-11-07 01:38:38,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:38:38,586 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:38:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:38:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:38:38,586 INFO L87 Difference]: Start difference. First operand 343 states and 515 transitions. Second operand 3 states. [2019-11-07 01:38:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:38:38,974 INFO L93 Difference]: Finished difference Result 1017 states and 1570 transitions. [2019-11-07 01:38:38,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:38:38,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-07 01:38:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:38:38,981 INFO L225 Difference]: With dead ends: 1017 [2019-11-07 01:38:38,981 INFO L226 Difference]: Without dead ends: 679 [2019-11-07 01:38:38,983 INFO L630 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-11-07 01:38:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-11-07 01:38:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2019-11-07 01:38:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-11-07 01:38:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 995 transitions. [2019-11-07 01:38:39,045 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 995 transitions. Word has length 120 [2019-11-07 01:38:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:38:39,048 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 995 transitions. [2019-11-07 01:38:39,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:38:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 995 transitions. [2019-11-07 01:38:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-07 01:38:39,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:38:39,053 INFO L410 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, 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] [2019-11-07 01:38:39,054 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:38:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:38:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1383621181, now seen corresponding path program 1 times [2019-11-07 01:38:39,054 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:38:39,055 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12155503] [2019-11-07 01:38:39,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:38:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:38:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:38:39,325 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12155503] [2019-11-07 01:38:39,325 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098282258] [2019-11-07 01:38:39,326 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-11-07 01:38:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:38:39,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 01:38:39,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:38:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:38:39,541 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:38:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:38:39,613 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:38:39,613 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-11-07 01:38:39,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281227411] [2019-11-07 01:38:39,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:38:39,637 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:38:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:38:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:38:39,637 INFO L87 Difference]: Start difference. First operand 679 states and 995 transitions. Second operand 3 states. [2019-11-07 01:38:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:38:40,021 INFO L93 Difference]: Finished difference Result 1185 states and 1789 transitions. [2019-11-07 01:38:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:38:40,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-07 01:38:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:38:40,029 INFO L225 Difference]: With dead ends: 1185 [2019-11-07 01:38:40,029 INFO L226 Difference]: Without dead ends: 1183 [2019-11-07 01:38:40,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 274 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:38:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-07 01:38:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1099. [2019-11-07 01:38:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-11-07 01:38:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1633 transitions. [2019-11-07 01:38:40,082 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1633 transitions. Word has length 137 [2019-11-07 01:38:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:38:40,083 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 1633 transitions. [2019-11-07 01:38:40,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:38:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1633 transitions. [2019-11-07 01:38:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-07 01:38:40,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:38:40,088 INFO L410 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, 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] [2019-11-07 01:38:40,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:38:40,292 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:38:40,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:38:40,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1126475805, now seen corresponding path program 1 times [2019-11-07 01:38:40,293 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:38:40,296 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988675963] [2019-11-07 01:38:40,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:38:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:38:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:38:40,544 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988675963] [2019-11-07 01:38:40,544 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:38:40,544 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:38:40,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108461434] [2019-11-07 01:38:40,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:38:40,545 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:38:40,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:38:40,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:38:40,546 INFO L87 Difference]: Start difference. First operand 1099 states and 1633 transitions. Second operand 6 states. [2019-11-07 01:38:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:38:40,898 INFO L93 Difference]: Finished difference Result 2029 states and 2953 transitions. [2019-11-07 01:38:40,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:38:40,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-11-07 01:38:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:38:40,901 INFO L225 Difference]: With dead ends: 2029 [2019-11-07 01:38:40,901 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 01:38:40,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:38:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 01:38:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 01:38:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 01:38:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 01:38:40,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2019-11-07 01:38:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:38:40,907 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 01:38:40,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:38:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 01:38:40,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 01:38:40,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 01:38:41,222 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-11-07 01:38:41,317 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a17~0 |old(~a17~0)|) [2019-11-07 01:38:41,317 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:38:41,317 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-07 01:38:41,318 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-07 01:38:41,318 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-07 01:38:41,318 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-07 01:38:41,318 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-07 01:38:41,318 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-07 01:38:41,318 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-07 01:38:41,318 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-07 01:38:41,319 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-07 01:38:41,321 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-07 01:38:41,322 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-07 01:38:41,322 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-07 01:38:41,322 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-07 01:38:41,322 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-07 01:38:41,322 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-07 01:38:41,322 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-07 01:38:41,323 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-07 01:38:41,324 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-07 01:38:41,324 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-07 01:38:41,324 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-07 01:38:41,324 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-07 01:38:41,324 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-07 01:38:41,324 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-07 01:38:41,324 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-07 01:38:41,325 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-07 01:38:41,327 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-07 01:38:41,328 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-07 01:38:41,328 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-07 01:38:41,328 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-11-07 01:38:41,328 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-11-07 01:38:41,328 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-07 01:38:41,328 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-07 01:38:41,328 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-07 01:38:41,329 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-07 01:38:41,329 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-07 01:38:41,329 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-07 01:38:41,329 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-07 01:38:41,329 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-07 01:38:41,329 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-07 01:38:41,329 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-07 01:38:41,329 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-07 01:38:41,330 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-07 01:38:41,336 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-07 01:38:41,336 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-07 01:38:41,336 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-07 01:38:41,336 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-07 01:38:41,336 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-07 01:38:41,337 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-07 01:38:41,337 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-07 01:38:41,337 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (= ~a11~0 1)) (.cse2 (not (= 1 |old(~a11~0)|))) (.cse4 (not (= 1 |old(~a25~0)|))) (.cse6 (= ~a25~0 1)) (.cse8 (= 9 |old(~a28~0)|)) (.cse7 (not (= ~a28~0 9))) (.cse1 (not (<= 8 |old(~a17~0)|))) (.cse3 (= 9 |old(~a17~0)|)) (.cse5 (= ~a17~0 |old(~a17~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (and .cse5 .cse6 .cse0) .cse2 .cse3) (or (and .cse5 .cse0 .cse7) .cse8 .cse2 .cse3) (or (and .cse5 .cse6 .cse7) .cse3 (or .cse4 .cse8)) (or .cse1 .cse4 .cse6 .cse3) (or .cse1 .cse8 .cse7 .cse3) (or .cse1 .cse3 .cse5))) [2019-11-07 01:38:41,337 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-07 01:38:41,337 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-07 01:38:41,338 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-07 01:38:41,338 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-07 01:38:41,338 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-07 01:38:41,338 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-07 01:38:41,338 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-07 01:38:41,338 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-07 01:38:41,338 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-07 01:38:41,338 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-07 01:38:41,339 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-07 01:38:41,341 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-07 01:38:41,341 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-07 01:38:41,341 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-07 01:38:41,341 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 514) no Hoare annotation was computed. [2019-11-07 01:38:41,342 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-07 01:38:41,342 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-07 01:38:41,342 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-07 01:38:41,342 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-07 01:38:41,342 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-07 01:38:41,342 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-07 01:38:41,342 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-07 01:38:41,343 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-07 01:38:41,343 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-07 01:38:41,343 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:38:41,343 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 8 ~a17~0) (not (= ~a28~0 9)) (not (= ~a17~0 9))) [2019-11-07 01:38:41,343 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 01:38:41,343 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 01:38:41,344 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (<= 8 |old(~a17~0)|)) (= 9 |old(~a28~0)|) (and (= ~a17~0 |old(~a17~0)|) (not (= ~a28~0 9))) (= 9 |old(~a17~0)|)) [2019-11-07 01:38:41,346 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (= ~a11~0 1)) (.cse1 (not (= ~a17~0 9)))) (or (not (<= 8 |old(~a17~0)|)) (and (= ~a25~0 1) .cse0 .cse1) (and .cse0 (not (= ~a28~0 9)) .cse1) (= 9 |old(~a28~0)|) (= 9 |old(~a17~0)|) (= ~a17~0 |old(~a17~0)|))) [2019-11-07 01:38:41,346 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-11-07 01:38:41,346 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-11-07 01:38:41,346 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= ~a11~0 1)) (.cse1 (not (= ~a17~0 9)))) (or (not (<= 8 |old(~a17~0)|)) (and (= ~a25~0 1) .cse0 .cse1) (and .cse0 (not (= ~a28~0 9)) .cse1) (= 9 |old(~a28~0)|) (= 9 |old(~a17~0)|) (= ~a17~0 |old(~a17~0)|))) [2019-11-07 01:38:41,347 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-11-07 01:38:41,347 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-07 01:38:41,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:38:41 BoogieIcfgContainer [2019-11-07 01:38:41,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 01:38:41,383 INFO L168 Benchmark]: Toolchain (without parser) took 8008.27 ms. Allocated memory was 136.8 MB in the beginning and 351.8 MB in the end (delta: 215.0 MB). Free memory was 99.8 MB in the beginning and 259.3 MB in the end (delta: -159.5 MB). Peak memory consumption was 191.1 MB. Max. memory is 7.1 GB. [2019-11-07 01:38:41,385 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 01:38:41,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.47 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 99.6 MB in the beginning and 170.6 MB in the end (delta: -71.0 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. [2019-11-07 01:38:41,389 INFO L168 Benchmark]: Boogie Preprocessor took 103.24 ms. Allocated memory is still 203.4 MB. Free memory was 170.6 MB in the beginning and 165.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-11-07 01:38:41,394 INFO L168 Benchmark]: RCFGBuilder took 2061.65 ms. Allocated memory was 203.4 MB in the beginning and 256.9 MB in the end (delta: 53.5 MB). Free memory was 165.4 MB in the beginning and 215.5 MB in the end (delta: -50.0 MB). Peak memory consumption was 119.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:38:41,395 INFO L168 Benchmark]: TraceAbstraction took 4965.06 ms. Allocated memory was 256.9 MB in the beginning and 351.8 MB in the end (delta: 94.9 MB). Free memory was 215.5 MB in the beginning and 259.3 MB in the end (delta: -43.9 MB). Peak memory consumption was 186.7 MB. Max. memory is 7.1 GB. [2019-11-07 01:38:41,405 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 136.8 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 871.47 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 99.6 MB in the beginning and 170.6 MB in the end (delta: -71.0 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.24 ms. Allocated memory is still 203.4 MB. Free memory was 170.6 MB in the beginning and 165.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2061.65 ms. Allocated memory was 203.4 MB in the beginning and 256.9 MB in the end (delta: 53.5 MB). Free memory was 165.4 MB in the beginning and 215.5 MB in the end (delta: -50.0 MB). Peak memory consumption was 119.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4965.06 ms. Allocated memory was 256.9 MB in the beginning and 351.8 MB in the end (delta: 94.9 MB). Free memory was 215.5 MB in the beginning and 259.3 MB in the end (delta: -43.9 MB). Peak memory consumption was 186.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 514]: 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: 606]: Loop Invariant Derived loop invariant: ((((!(8 <= \old(a17)) || ((a25 == 1 && a11 == 1) && !(a17 == 9))) || ((a11 == 1 && !(a28 == 9)) && !(a17 == 9))) || 9 == \old(a28)) || 9 == \old(a17)) || a17 == \old(a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 1 error locations. Result: SAFE, OverallTime: 4.8s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 416 SDtfs, 357 SDslu, 73 SDs, 0 SdLazy, 1226 SolverSat, 362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 289 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1099occurred 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, 84 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 37 PreInvPairs, 59 NumberOfFragments, 233 HoareAnnotationTreeSize, 37 FomulaSimplifications, 264 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 258 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 846 ConstructedInterpolants, 0 QuantifiedInterpolants, 296937 SizeOfPredicates, 2 NumberOfNonLiveVariables, 372 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 229/233 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...