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_label11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:39:26,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:39:26,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:39:26,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:39:26,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:39:26,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:39:26,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:39:26,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:39:26,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:39:26,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:39:26,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:39:26,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:39:26,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:39:26,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:39:26,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:39:26,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:39:26,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:39:26,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:39:26,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:39:26,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:39:26,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:39:26,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:39:26,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:39:26,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:39:26,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:39:26,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:39:26,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:39:26,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:39:26,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:39:26,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:39:26,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:39:26,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:39:26,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:39:26,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:39:26,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:39:26,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:39:26,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:39:26,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:39:26,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:39:26,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:39:26,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:39:26,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:39:26,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:39:26,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:39:26,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:39:26,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:39:26,473 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:39:26,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:39:26,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:39:26,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:39:26,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:39:26,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:39:26,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:39:26,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:39:26,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:39:26,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:39:26,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:39:26,476 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:39:26,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:39:26,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:39:26,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:39:26,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:39:26,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:39:26,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:39:26,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:39:26,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:39:26,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:39:26,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:39:26,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:39:26,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:39:26,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:39:26,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:39:26,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:39:26,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:39:26,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:39:26,819 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:39:26,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11.c [2019-10-15 01:39:26,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3250c7bb/cca39cde8f5645c4a7432f36eeaaeb0e/FLAG720e15931 [2019-10-15 01:39:27,446 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:39:27,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11.c [2019-10-15 01:39:27,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3250c7bb/cca39cde8f5645c4a7432f36eeaaeb0e/FLAG720e15931 [2019-10-15 01:39:27,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3250c7bb/cca39cde8f5645c4a7432f36eeaaeb0e [2019-10-15 01:39:27,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:39:27,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:39:27,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:39:27,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:39:27,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:39:27,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:39:27" (1/1) ... [2019-10-15 01:39:27,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb6fecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:27, skipping insertion in model container [2019-10-15 01:39:27,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:39:27" (1/1) ... [2019-10-15 01:39:27,797 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:39:27,860 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:39:28,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:39:28,395 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:39:28,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:39:28,535 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:39:28,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28 WrapperNode [2019-10-15 01:39:28,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:39:28,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:39:28,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:39:28,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:39:28,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (1/1) ... [2019-10-15 01:39:28,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (1/1) ... [2019-10-15 01:39:28,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (1/1) ... [2019-10-15 01:39:28,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (1/1) ... [2019-10-15 01:39:28,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (1/1) ... [2019-10-15 01:39:28,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (1/1) ... [2019-10-15 01:39:28,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (1/1) ... [2019-10-15 01:39:28,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:39:28,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:39:28,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:39:28,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:39:28,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:39:28,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:39:28,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:39:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 01:39:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:39:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 01:39:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:39:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:39:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:39:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:39:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:39:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:39:30,509 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:39:30,509 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:39:30,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:39:30 BoogieIcfgContainer [2019-10-15 01:39:30,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:39:30,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:39:30,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:39:30,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:39:30,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:39:27" (1/3) ... [2019-10-15 01:39:30,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170c015f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:39:30, skipping insertion in model container [2019-10-15 01:39:30,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:28" (2/3) ... [2019-10-15 01:39:30,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170c015f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:39:30, skipping insertion in model container [2019-10-15 01:39:30,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:39:30" (3/3) ... [2019-10-15 01:39:30,520 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label11.c [2019-10-15 01:39:30,530 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:39:30,539 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:39:30,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:39:30,576 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:39:30,577 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:39:30,577 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:39:30,577 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:39:30,577 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:39:30,577 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:39:30,578 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:39:30,578 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:39:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-15 01:39:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:39:30,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:30,609 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-15 01:39:30,611 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:30,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:30,617 INFO L82 PathProgramCache]: Analyzing trace with hash 826820708, now seen corresponding path program 1 times [2019-10-15 01:39:30,627 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:30,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756173750] [2019-10-15 01:39:30,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:30,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:30,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:31,109 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-15 01:39:31,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756173750] [2019-10-15 01:39:31,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:31,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:39:31,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365745731] [2019-10-15 01:39:31,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:39:31,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:39:31,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:39:31,142 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-15 01:39:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:31,659 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-15 01:39:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:39:31,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-15 01:39:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:31,687 INFO L225 Difference]: With dead ends: 246 [2019-10-15 01:39:31,687 INFO L226 Difference]: Without dead ends: 157 [2019-10-15 01:39:31,693 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-15 01:39:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-15 01:39:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-15 01:39:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-15 01:39:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-15 01:39:31,819 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-15 01:39:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:31,821 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-15 01:39:31,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:39:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-15 01:39:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 01:39:31,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:31,830 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:39:31,830 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1195665925, now seen corresponding path program 1 times [2019-10-15 01:39:31,832 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:31,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181817778] [2019-10-15 01:39:31,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:31,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:31,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:39:32,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181817778] [2019-10-15 01:39:32,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:32,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:39:32,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049774005] [2019-10-15 01:39:32,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:39:32,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:32,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:39:32,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:39:32,010 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-15 01:39:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:32,618 INFO L93 Difference]: Finished difference Result 402 states and 725 transitions. [2019-10-15 01:39:32,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:39:32,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-15 01:39:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:32,627 INFO L225 Difference]: With dead ends: 402 [2019-10-15 01:39:32,627 INFO L226 Difference]: Without dead ends: 250 [2019-10-15 01:39:32,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:39:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-15 01:39:32,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-10-15 01:39:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-15 01:39:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 407 transitions. [2019-10-15 01:39:32,666 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 407 transitions. Word has length 87 [2019-10-15 01:39:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:32,666 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 407 transitions. [2019-10-15 01:39:32,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:39:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 407 transitions. [2019-10-15 01:39:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 01:39:32,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:32,670 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:39:32,670 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2128687529, now seen corresponding path program 1 times [2019-10-15 01:39:32,671 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:32,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799664004] [2019-10-15 01:39:32,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:32,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:32,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:39:32,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799664004] [2019-10-15 01:39:32,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:32,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:39:32,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955215607] [2019-10-15 01:39:32,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:39:32,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:39:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:39:32,790 INFO L87 Difference]: Start difference. First operand 238 states and 407 transitions. Second operand 4 states. [2019-10-15 01:39:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:33,521 INFO L93 Difference]: Finished difference Result 852 states and 1533 transitions. [2019-10-15 01:39:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:39:33,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-15 01:39:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:33,528 INFO L225 Difference]: With dead ends: 852 [2019-10-15 01:39:33,528 INFO L226 Difference]: Without dead ends: 619 [2019-10-15 01:39:33,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:39:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-15 01:39:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 544. [2019-10-15 01:39:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-15 01:39:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 888 transitions. [2019-10-15 01:39:33,623 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 888 transitions. Word has length 88 [2019-10-15 01:39:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:33,624 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 888 transitions. [2019-10-15 01:39:33,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:39:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 888 transitions. [2019-10-15 01:39:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:39:33,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:33,632 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-15 01:39:33,637 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash 579795659, now seen corresponding path program 1 times [2019-10-15 01:39:33,638 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:33,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328678966] [2019-10-15 01:39:33,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:33,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:33,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:33,785 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-15 01:39:33,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328678966] [2019-10-15 01:39:33,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:33,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:39:33,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236998674] [2019-10-15 01:39:33,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:39:33,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:33,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:39:33,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:39:33,789 INFO L87 Difference]: Start difference. First operand 544 states and 888 transitions. Second operand 3 states. [2019-10-15 01:39:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:34,255 INFO L93 Difference]: Finished difference Result 1543 states and 2645 transitions. [2019-10-15 01:39:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:39:34,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-15 01:39:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:34,264 INFO L225 Difference]: With dead ends: 1543 [2019-10-15 01:39:34,264 INFO L226 Difference]: Without dead ends: 1004 [2019-10-15 01:39:34,266 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-15 01:39:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-10-15 01:39:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2019-10-15 01:39:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-10-15 01:39:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1637 transitions. [2019-10-15 01:39:34,317 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1637 transitions. Word has length 94 [2019-10-15 01:39:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:34,318 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1637 transitions. [2019-10-15 01:39:34,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:39:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1637 transitions. [2019-10-15 01:39:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:39:34,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:34,327 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-15 01:39:34,327 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:34,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:34,327 INFO L82 PathProgramCache]: Analyzing trace with hash 95151799, now seen corresponding path program 1 times [2019-10-15 01:39:34,328 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:34,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977221931] [2019-10-15 01:39:34,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:34,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:34,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:34,443 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-15 01:39:34,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977221931] [2019-10-15 01:39:34,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:34,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:39:34,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791109764] [2019-10-15 01:39:34,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:39:34,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:34,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:39:34,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:39:34,446 INFO L87 Difference]: Start difference. First operand 1004 states and 1637 transitions. Second operand 6 states. [2019-10-15 01:39:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:35,071 INFO L93 Difference]: Finished difference Result 2442 states and 4169 transitions. [2019-10-15 01:39:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:39:35,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-15 01:39:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:35,072 INFO L225 Difference]: With dead ends: 2442 [2019-10-15 01:39:35,072 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:39:35,080 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-15 01:39:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:39:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:39:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:39:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:39:35,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2019-10-15 01:39:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:35,083 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:39:35,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:39:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:39:35,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:39:35,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:39:35,635 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2019-10-15 01:39:35,789 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= ~a16~0 |old(~a16~0)|)) [2019-10-15 01:39:35,789 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:39:35,789 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-15 01:39:35,790 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-15 01:39:35,790 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:39:35,790 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-15 01:39:35,790 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-15 01:39:35,790 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2019-10-15 01:39:35,790 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-15 01:39:35,790 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-15 01:39:35,791 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:39:35,791 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-15 01:39:35,791 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-15 01:39:35,791 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-15 01:39:35,791 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-15 01:39:35,791 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-15 01:39:35,792 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-15 01:39:35,792 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-15 01:39:35,792 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-15 01:39:35,792 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-15 01:39:35,792 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-15 01:39:35,792 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-15 01:39:35,792 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-15 01:39:35,792 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-15 01:39:35,793 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-15 01:39:35,793 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-15 01:39:35,793 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-15 01:39:35,793 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-15 01:39:35,793 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-15 01:39:35,793 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-15 01:39:35,793 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-15 01:39:35,793 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-15 01:39:35,794 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-15 01:39:35,794 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-15 01:39:35,794 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-15 01:39:35,794 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:39:35,794 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:39:35,794 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-15 01:39:35,794 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-15 01:39:35,794 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-15 01:39:35,795 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-15 01:39:35,795 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-15 01:39:35,795 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-15 01:39:35,795 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-15 01:39:35,795 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-15 01:39:35,795 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-15 01:39:35,795 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-15 01:39:35,795 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-15 01:39:35,796 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-15 01:39:35,796 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-15 01:39:35,796 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-15 01:39:35,796 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-15 01:39:35,796 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-15 01:39:35,796 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-15 01:39:35,797 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a7~0 |old(~a7~0)|)) (.cse3 (= ~a16~0 |old(~a16~0)|))) (let ((.cse5 (not (= 14 ~a8~0))) (.cse9 (not (= ~a17~0 1))) (.cse7 (= 1 |old(~a17~0)|)) (.cse6 (= 14 |old(~a8~0)|)) (.cse0 (= 6 |old(~a16~0)|)) (.cse10 (and .cse1 .cse3)) (.cse8 (= 1 |old(~a7~0)|)) (.cse2 (= 13 ~a8~0)) (.cse4 (not (= 13 |old(~a8~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4) (or .cse0 .cse5 .cse6 .cse7) (or .cse8 .cse6 .cse5) (or .cse0 .cse7 (and .cse1 .cse3 .cse9)) (or .cse8 .cse6 .cse7 .cse9) (or (and .cse1 .cse2 .cse3 .cse9) .cse7 .cse4) (or .cse8 .cse10 .cse6) (or .cse0 .cse8 .cse10) (or .cse8 .cse2 .cse4)))) [2019-10-15 01:39:35,797 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-15 01:39:35,797 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-15 01:39:35,797 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-15 01:39:35,797 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-15 01:39:35,797 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-15 01:39:35,797 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-15 01:39:35,798 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-15 01:39:35,798 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-15 01:39:35,798 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-15 01:39:35,798 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-15 01:39:35,798 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-15 01:39:35,798 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-15 01:39:35,798 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-15 01:39:35,799 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-15 01:39:35,799 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-15 01:39:35,799 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-15 01:39:35,799 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-15 01:39:35,799 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-15 01:39:35,799 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-15 01:39:35,799 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-15 01:39:35,799 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:39:35,800 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a7~0 1)) (not (= ~a16~0 6)) (not (= 14 ~a8~0)) (not (= ~a16~0 4))) [2019-10-15 01:39:35,800 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:39:35,800 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:39:35,800 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (= 4 |old(~a16~0)|) (= 14 |old(~a8~0)|) (and (= ~a7~0 |old(~a7~0)|) (= ~a16~0 |old(~a16~0)|) (not (= 14 ~a8~0)))) [2019-10-15 01:39:35,800 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-15 01:39:35,800 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (not (= ~a7~0 1))) (.cse0 (not (= ~a16~0 6))) (.cse3 (= 13 ~a8~0)) (.cse1 (not (= ~a17~0 1)))) (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (and .cse0 .cse1) (= 4 |old(~a16~0)|) (and .cse2 .cse0) (= 14 |old(~a8~0)|) (and .cse2 (not (= 14 ~a8~0))) (and .cse3 .cse0) (and .cse3 .cse1))) [2019-10-15 01:39:35,800 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-15 01:39:35,801 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-15 01:39:35,801 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~a7~0 1))) (.cse0 (not (= ~a16~0 6))) (.cse3 (= 13 ~a8~0)) (.cse1 (not (= ~a17~0 1)))) (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (and .cse0 .cse1) (= 4 |old(~a16~0)|) (and .cse2 .cse0) (= 14 |old(~a8~0)|) (and .cse2 (not (= 14 ~a8~0))) (and .cse3 .cse0) (and .cse3 .cse1))) [2019-10-15 01:39:35,801 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-15 01:39:35,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:39:35 BoogieIcfgContainer [2019-10-15 01:39:35,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:39:35,819 INFO L168 Benchmark]: Toolchain (without parser) took 8038.06 ms. Allocated memory was 147.8 MB in the beginning and 316.1 MB in the end (delta: 168.3 MB). Free memory was 104.2 MB in the beginning and 124.2 MB in the end (delta: -20.0 MB). Peak memory consumption was 148.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:35,820 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 147.8 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:39:35,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.70 ms. Allocated memory was 147.8 MB in the beginning and 206.6 MB in the end (delta: 58.7 MB). Free memory was 104.0 MB in the beginning and 172.4 MB in the end (delta: -68.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:35,822 INFO L168 Benchmark]: Boogie Preprocessor took 130.29 ms. Allocated memory is still 206.6 MB. Free memory was 172.4 MB in the beginning and 167.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:35,823 INFO L168 Benchmark]: RCFGBuilder took 1843.83 ms. Allocated memory was 206.6 MB in the beginning and 246.9 MB in the end (delta: 40.4 MB). Free memory was 167.7 MB in the beginning and 197.1 MB in the end (delta: -29.4 MB). Peak memory consumption was 107.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:35,824 INFO L168 Benchmark]: TraceAbstraction took 5304.80 ms. Allocated memory was 246.9 MB in the beginning and 316.1 MB in the end (delta: 69.2 MB). Free memory was 197.1 MB in the beginning and 124.2 MB in the end (delta: 72.9 MB). Peak memory consumption was 142.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:35,833 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.15 ms. Allocated memory is still 147.8 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.70 ms. Allocated memory was 147.8 MB in the beginning and 206.6 MB in the end (delta: 58.7 MB). Free memory was 104.0 MB in the beginning and 172.4 MB in the end (delta: -68.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.29 ms. Allocated memory is still 206.6 MB. Free memory was 172.4 MB in the beginning and 167.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1843.83 ms. Allocated memory was 206.6 MB in the beginning and 246.9 MB in the end (delta: 40.4 MB). Free memory was 167.7 MB in the beginning and 197.1 MB in the end (delta: -29.4 MB). Peak memory consumption was 107.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5304.80 ms. Allocated memory was 246.9 MB in the beginning and 316.1 MB in the end (delta: 69.2 MB). Free memory was 197.1 MB in the beginning and 124.2 MB in the end (delta: 72.9 MB). Peak memory consumption was 142.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: 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: (((((((6 == \old(a16) || 1 == \old(a7)) || (!(a16 == 6) && !(a17 == 1))) || 4 == \old(a16)) || (!(a7 == 1) && !(a16 == 6))) || 14 == \old(a8)) || (!(a7 == 1) && !(14 == a8))) || (13 == a8 && !(a16 == 6))) || (13 == a8 && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 246 SDtfs, 685 SDslu, 111 SDs, 0 SdLazy, 1696 SolverSat, 429 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1004occurred 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, 87 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 57 PreInvPairs, 107 NumberOfFragments, 298 HoareAnnotationTreeSize, 57 FomulaSimplifications, 1347 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 481 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 131071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 70/70 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...