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 -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:48:13,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:48:13,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:48:13,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:48:13,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:48:13,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:48:13,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:48:13,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:48:13,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:48:13,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:48:13,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:48:13,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:48:13,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:48:13,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:48:13,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:48:13,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:48:13,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:48:13,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:48:13,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:48:13,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:48:13,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:48:13,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:48:13,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:48:13,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:48:13,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:48:13,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:48:13,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:48:13,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:48:13,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:48:13,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:48:13,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:48:13,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:48:13,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:48:13,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:48:13,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:48:13,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:48:13,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:48:13,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:48:13,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:48:13,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:48:13,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:48:13,414 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-02 00:48:13,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:48:13,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:48:13,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:48:13,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:48:13,430 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:48:13,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:48:13,431 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:48:13,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:48:13,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:48:13,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:48:13,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:48:13,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:48:13,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:48:13,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:48:13,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:48:13,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:48:13,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:48:13,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:48:13,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:48:13,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:48:13,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:48:13,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:48:13,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:48:13,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:48:13,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:48:13,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:48:13,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:48:13,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:48:13,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:48:13,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:48:13,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:48:13,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:48:13,484 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:48:13,485 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:48:13,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51.c [2019-10-02 00:48:13,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5eca08db/36c881f277ec4a00afe148de806e89ac/FLAGdd0fef41a [2019-10-02 00:48:14,089 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:48:14,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label51.c [2019-10-02 00:48:14,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5eca08db/36c881f277ec4a00afe148de806e89ac/FLAGdd0fef41a [2019-10-02 00:48:14,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5eca08db/36c881f277ec4a00afe148de806e89ac [2019-10-02 00:48:14,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:48:14,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:48:14,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:14,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:48:14,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:48:14,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:14" (1/1) ... [2019-10-02 00:48:14,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae0ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:14, skipping insertion in model container [2019-10-02 00:48:14,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:14" (1/1) ... [2019-10-02 00:48:14,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:48:14,436 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:48:14,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:14,988 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:48:15,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:15,116 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:48:15,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15 WrapperNode [2019-10-02 00:48:15,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:15,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:48:15,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:48:15,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:48:15,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (1/1) ... [2019-10-02 00:48:15,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (1/1) ... [2019-10-02 00:48:15,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (1/1) ... [2019-10-02 00:48:15,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (1/1) ... [2019-10-02 00:48:15,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (1/1) ... [2019-10-02 00:48:15,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (1/1) ... [2019-10-02 00:48:15,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (1/1) ... [2019-10-02 00:48:15,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:48:15,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:48:15,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:48:15,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:48:15,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (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-02 00:48:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:48:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:48:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:48:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:48:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:48:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:48:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:48:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:48:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:48:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:48:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:48:16,553 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:48:16,553 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:48:16,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:16 BoogieIcfgContainer [2019-10-02 00:48:16,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:48:16,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:48:16,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:48:16,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:48:16,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:48:14" (1/3) ... [2019-10-02 00:48:16,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41996c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:16, skipping insertion in model container [2019-10-02 00:48:16,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:15" (2/3) ... [2019-10-02 00:48:16,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41996c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:16, skipping insertion in model container [2019-10-02 00:48:16,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:16" (3/3) ... [2019-10-02 00:48:16,567 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label51.c [2019-10-02 00:48:16,578 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:48:16,587 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:48:16,605 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:48:16,643 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:48:16,644 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:48:16,644 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:48:16,644 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:48:16,645 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:48:16,645 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:48:16,645 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:48:16,645 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:48:16,646 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:48:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 00:48:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 00:48:16,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:16,682 INFO L411 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, 1, 1, 1, 1, 1, 1, 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-02 00:48:16,684 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1960329542, now seen corresponding path program 1 times [2019-10-02 00:48:16,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:16,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:16,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:17,121 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-02 00:48:17,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:17,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:48:17,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:48:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:48:17,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:48:17,153 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 00:48:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:18,055 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-02 00:48:18,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:48:18,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-02 00:48:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:18,087 INFO L225 Difference]: With dead ends: 618 [2019-10-02 00:48:18,087 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:18,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:48:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 00:48:18,186 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 116 [2019-10-02 00:48:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:18,187 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 00:48:18,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:48:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 00:48:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 00:48:18,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:18,193 INFO L411 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, 1, 1, 1, 1, 1, 1, 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-02 00:48:18,193 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:18,194 INFO L82 PathProgramCache]: Analyzing trace with hash -994304287, now seen corresponding path program 1 times [2019-10-02 00:48:18,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:18,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:18,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:18,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:18,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:18,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:18,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:18,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:18,482 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 00:48:19,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:19,141 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-02 00:48:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:19,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-10-02 00:48:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:19,149 INFO L225 Difference]: With dead ends: 721 [2019-10-02 00:48:19,149 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:19,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 00:48:19,169 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 124 [2019-10-02 00:48:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:19,170 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 00:48:19,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 00:48:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 00:48:19,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:19,173 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 00:48:19,174 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash 418207893, now seen corresponding path program 1 times [2019-10-02 00:48:19,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:19,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:19,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:19,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:19,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:19,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:19,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:19,512 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 00:48:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:20,193 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-02 00:48:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:20,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-02 00:48:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:20,200 INFO L225 Difference]: With dead ends: 717 [2019-10-02 00:48:20,200 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:20,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 00:48:20,217 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 130 [2019-10-02 00:48:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:20,217 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 00:48:20,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 00:48:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 00:48:20,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:20,221 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 00:48:20,221 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash 431960158, now seen corresponding path program 1 times [2019-10-02 00:48:20,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:20,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:20,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:20,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:20,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:20,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:20,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:20,368 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 00:48:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:21,227 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-02 00:48:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:21,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-02 00:48:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:21,232 INFO L225 Difference]: With dead ends: 951 [2019-10-02 00:48:21,232 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 00:48:21,233 INFO L640 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-02 00:48:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 00:48:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 00:48:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-02 00:48:21,262 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 138 [2019-10-02 00:48:21,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:21,262 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-02 00:48:21,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-02 00:48:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 00:48:21,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:21,267 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 00:48:21,268 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1228482458, now seen corresponding path program 1 times [2019-10-02 00:48:21,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:21,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:21,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:21,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:21,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:21,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:21,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:21,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:21,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:21,493 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-02 00:48:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:22,237 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2019-10-02 00:48:22,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:22,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-10-02 00:48:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:22,242 INFO L225 Difference]: With dead ends: 1330 [2019-10-02 00:48:22,242 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:22,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-02 00:48:22,267 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 140 [2019-10-02 00:48:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:22,268 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-02 00:48:22,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-02 00:48:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 00:48:22,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:22,272 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 00:48:22,272 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash 725638870, now seen corresponding path program 1 times [2019-10-02 00:48:22,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:22,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:22,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:22,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:22,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:22,525 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-02 00:48:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:23,173 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2019-10-02 00:48:23,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:23,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-02 00:48:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:23,180 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 00:48:23,180 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:23,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-02 00:48:23,210 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 142 [2019-10-02 00:48:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:23,211 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-02 00:48:23,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-02 00:48:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 00:48:23,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:23,215 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 00:48:23,215 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1581871794, now seen corresponding path program 1 times [2019-10-02 00:48:23,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:23,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:23,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:23,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:23,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:23,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:23,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:23,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:23,326 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-02 00:48:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:24,026 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2019-10-02 00:48:24,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:24,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 00:48:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:24,035 INFO L225 Difference]: With dead ends: 1858 [2019-10-02 00:48:24,035 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 00:48:24,037 INFO L640 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-02 00:48:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 00:48:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 00:48:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 00:48:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-02 00:48:24,080 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 146 [2019-10-02 00:48:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:24,080 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-02 00:48:24,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-02 00:48:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 00:48:24,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:24,086 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:24,086 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 93497294, now seen corresponding path program 1 times [2019-10-02 00:48:24,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:24,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:24,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:24,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:24,220 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:48:24,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:24,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:24,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:48:24,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:48:24,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:48:24,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:48:24,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:48:24,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:48:24,477 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 7 states. [2019-10-02 00:48:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:25,927 INFO L93 Difference]: Finished difference Result 3651 states and 5065 transitions. [2019-10-02 00:48:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:25,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-10-02 00:48:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:25,938 INFO L225 Difference]: With dead ends: 3651 [2019-10-02 00:48:25,939 INFO L226 Difference]: Without dead ends: 1542 [2019-10-02 00:48:25,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:48:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-10-02 00:48:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1518. [2019-10-02 00:48:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2019-10-02 00:48:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1898 transitions. [2019-10-02 00:48:25,989 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1898 transitions. Word has length 180 [2019-10-02 00:48:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:25,990 INFO L475 AbstractCegarLoop]: Abstraction has 1518 states and 1898 transitions. [2019-10-02 00:48:25,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:48:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1898 transitions. [2019-10-02 00:48:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 00:48:25,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:25,996 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:25,997 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash 243078476, now seen corresponding path program 1 times [2019-10-02 00:48:25,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:25,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:25,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 139 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:26,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:26,199 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:48:26,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:48:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:26,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:26,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 00:48:26,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:48:26,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 00:48:26,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 00:48:26,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 00:48:26,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:48:26,411 INFO L87 Difference]: Start difference. First operand 1518 states and 1898 transitions. Second operand 14 states. [2019-10-02 00:48:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:28,588 INFO L93 Difference]: Finished difference Result 3186 states and 3998 transitions. [2019-10-02 00:48:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:28,589 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 231 [2019-10-02 00:48:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:28,590 INFO L225 Difference]: With dead ends: 3186 [2019-10-02 00:48:28,590 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:48:28,598 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:48:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:48:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:48:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:48:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:48:28,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2019-10-02 00:48:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:28,599 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:48:28,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 00:48:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:48:28,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:48:28,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:48:30,086 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-10-02 00:48:30,421 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 00:48:30,736 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 00:48:30,739 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:30,739 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-02 00:48:30,739 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:30,739 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,740 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,740 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,740 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,740 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,740 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-02 00:48:30,740 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-02 00:48:30,740 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-02 00:48:30,740 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-02 00:48:30,741 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-02 00:48:30,741 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-02 00:48:30,741 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-02 00:48:30,741 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-02 00:48:30,741 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-02 00:48:30,741 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-02 00:48:30,741 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:30,741 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:30,742 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-02 00:48:30,742 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,742 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,742 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,742 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,742 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-02 00:48:30,742 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,743 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-02 00:48:30,743 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-02 00:48:30,743 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 00:48:30,743 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-02 00:48:30,743 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-02 00:48:30,743 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-02 00:48:30,743 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-02 00:48:30,744 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:30,744 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:30,744 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-02 00:48:30,744 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-02 00:48:30,744 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-02 00:48:30,744 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:30,744 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:30,744 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-02 00:48:30,745 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,745 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,745 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,745 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,745 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,745 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:30,745 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-02 00:48:30,745 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:30,746 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-02 00:48:30,746 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-02 00:48:30,746 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-02 00:48:30,746 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-02 00:48:30,746 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 00:48:30,746 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-02 00:48:30,746 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-02 00:48:30,747 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-02 00:48:30,747 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,747 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,747 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,747 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,747 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,747 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-02 00:48:30,747 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-02 00:48:30,748 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-02 00:48:30,748 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-02 00:48:30,748 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-02 00:48:30,748 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-02 00:48:30,748 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-02 00:48:30,748 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-02 00:48:30,748 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-02 00:48:30,748 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-02 00:48:30,749 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-02 00:48:30,749 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-02 00:48:30,749 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-02 00:48:30,749 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,749 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,749 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,749 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,749 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,750 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-02 00:48:30,750 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-02 00:48:30,750 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 00:48:30,750 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-02 00:48:30,750 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-02 00:48:30,750 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-02 00:48:30,750 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-02 00:48:30,751 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 502) no Hoare annotation was computed. [2019-10-02 00:48:30,751 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-02 00:48:30,751 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-02 00:48:30,751 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-02 00:48:30,751 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-02 00:48:30,751 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-02 00:48:30,751 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-02 00:48:30,751 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:30,752 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-02 00:48:30,752 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:30,752 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,752 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,752 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,752 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,752 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 00:48:30,752 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,753 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:30,753 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,753 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:30,753 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:30,753 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:30,753 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,753 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,753 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-02 00:48:30,754 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-02 00:48:30,755 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,756 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,757 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,757 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,757 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,757 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-02 00:48:30,757 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-02 00:48:30,757 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-02 00:48:30,757 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-02 00:48:30,758 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-02 00:48:30,758 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-02 00:48:30,758 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-02 00:48:30,758 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-02 00:48:30,758 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 00:48:30,758 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-02 00:48:30,758 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-02 00:48:30,758 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-02 00:48:30,759 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-02 00:48:30,759 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-02 00:48:30,759 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,759 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,759 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,760 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= 1 |old(~a19~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse6 (= 1 |old(~a25~0)|)) (.cse7 (not (= 1 ~a11~0))) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse16 (= ~a19~0 |old(~a19~0)|)) (.cse17 (= ~a28~0 |old(~a28~0)|)) (.cse18 (= ~a25~0 |old(~a25~0)|))) (let ((.cse3 (and .cse7 .cse15 .cse16 .cse17 .cse18)) (.cse12 (not (= 7 |old(~a28~0)|))) (.cse5 (= 9 |old(~a28~0)|)) (.cse9 (not .cse6)) (.cse11 (not .cse1)) (.cse10 (= ~a11~0 1)) (.cse8 (not (<= |old(~a17~0)| 7))) (.cse0 (not (= 1 ~a21~0))) (.cse2 (not .cse14)) (.cse13 (= 8 |old(~a28~0)|)) (.cse4 (not (= 8 |old(~a17~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse3 .cse5 .cse4 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse5 .cse8) (or .cse0 .cse9 .cse2 .cse4 .cse10 (not .cse5) .cse11) (or .cse0 .cse12 .cse9 .cse2 (and (= ~a17~0 7) .cse10) .cse11 (not (= 7 |old(~a17~0)|))) (or .cse0 .cse1 .cse13 .cse5 .cse4 .cse3) (or .cse0 .cse1 .cse7 .cse8 .cse6) (or .cse14 .cse0 .cse12 (and (not (= ~a19~0 1)) (not (= ~a25~0 1)) (= ~a17~0 8) (= ~a28~0 7) .cse10) .cse4 .cse11 .cse6) (or .cse0 .cse1 .cse2 .cse13 .cse15 .cse5 (not (<= |old(~a17~0)| 8)) .cse6) (or .cse0 (not (= 10 |old(~a28~0)|)) .cse9 .cse2 .cse4 .cse11 .cse10) (or .cse0 (and (<= ~a17~0 7) .cse16 .cse17 .cse18) .cse8) (or .cse0 .cse2 (and .cse15 .cse16 .cse17 .cse18) .cse13 .cse4)))) [2019-10-02 00:48:30,760 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,760 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,760 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,760 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-02 00:48:30,760 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-02 00:48:30,760 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-02 00:48:30,760 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-02 00:48:30,761 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-02 00:48:30,761 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-02 00:48:30,761 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-02 00:48:30,761 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-02 00:48:30,761 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-02 00:48:30,761 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-02 00:48:30,761 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-02 00:48:30,761 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-02 00:48:30,762 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-02 00:48:30,762 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,762 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,762 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,762 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,762 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,762 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,762 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-02 00:48:30,763 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-02 00:48:30,763 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-02 00:48:30,763 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-02 00:48:30,763 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-02 00:48:30,763 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-02 00:48:30,763 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-02 00:48:30,763 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-02 00:48:30,763 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,764 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,765 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,765 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,765 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:30,765 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-02 00:48:30,765 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-02 00:48:30,765 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-02 00:48:30,765 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-02 00:48:30,765 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-02 00:48:30,766 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-02 00:48:30,766 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-02 00:48:30,766 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-02 00:48:30,766 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-02 00:48:30,766 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-02 00:48:30,766 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-02 00:48:30,766 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:30,766 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-02 00:48:30,767 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:30,767 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-02 00:48:30,767 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:30,767 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:30,767 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-02 00:48:30,767 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-02 00:48:30,767 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:30,767 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (not (= ~a25~0 1)) (not (= ~a28~0 8)) (= ~a19~0 1) (= ~a21~0 1) (<= ~a17~0 8) (not (= ~a28~0 9))) [2019-10-02 00:48:30,768 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:48:30,768 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:30,768 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (not (= 1 ~a11~0)) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 9 |old(~a28~0)|) (not (<= |old(~a17~0)| 8)) (= 1 |old(~a25~0)|)) [2019-10-02 00:48:30,768 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a28~0 9)) (.cse9 (= ~a25~0 1))) (let ((.cse2 (not (= ~a28~0 8))) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse5 (not .cse9)) (.cse3 (not .cse8)) (.cse6 (= ~a17~0 8)) (.cse4 (= ~a19~0 1)) (.cse7 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and (not .cse4) .cse5 .cse6 (= ~a28~0 7) .cse7) (= 9 |old(~a28~0)|) (and .cse8 .cse6 .cse4 .cse9 .cse7) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse4) (= 1 |old(~a11~0)|) (and .cse0 .cse1 .cse5 .cse3) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (= ~a28~0 10) .cse6 .cse4 .cse9 .cse7) (not (<= |old(~a17~0)| 8))))) [2019-10-02 00:48:30,768 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:30,769 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:30,769 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse8 (= ~a28~0 9)) (.cse9 (= ~a25~0 1))) (let ((.cse2 (not (= ~a28~0 8))) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse5 (not .cse9)) (.cse3 (not .cse8)) (.cse6 (= ~a17~0 8)) (.cse4 (= ~a19~0 1)) (.cse7 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and (not .cse4) .cse5 .cse6 (= ~a28~0 7) .cse7) (= 9 |old(~a28~0)|) (and .cse8 .cse6 .cse4 .cse9 .cse7) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse4) (= 1 |old(~a11~0)|) (and .cse0 .cse1 .cse5 .cse3) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (= ~a28~0 10) .cse6 .cse4 .cse9 .cse7) (not (<= |old(~a17~0)| 8))))) [2019-10-02 00:48:30,769 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-02 00:48:30,769 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-02 00:48:30,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:48:30 BoogieIcfgContainer [2019-10-02 00:48:30,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:48:30,796 INFO L168 Benchmark]: Toolchain (without parser) took 16428.28 ms. Allocated memory was 140.5 MB in the beginning and 466.6 MB in the end (delta: 326.1 MB). Free memory was 86.7 MB in the beginning and 216.2 MB in the end (delta: -129.5 MB). Peak memory consumption was 333.6 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:30,797 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:48:30,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.74 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 86.5 MB in the beginning and 167.4 MB in the end (delta: -80.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:30,799 INFO L168 Benchmark]: Boogie Preprocessor took 103.06 ms. Allocated memory is still 203.9 MB. Free memory was 167.4 MB in the beginning and 162.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:30,800 INFO L168 Benchmark]: RCFGBuilder took 1335.50 ms. Allocated memory was 203.9 MB in the beginning and 229.6 MB in the end (delta: 25.7 MB). Free memory was 162.8 MB in the beginning and 179.3 MB in the end (delta: -16.5 MB). Peak memory consumption was 88.2 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:30,801 INFO L168 Benchmark]: TraceAbstraction took 14233.39 ms. Allocated memory was 229.6 MB in the beginning and 466.6 MB in the end (delta: 237.0 MB). Free memory was 179.3 MB in the beginning and 216.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 337.1 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:30,806 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.23 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.74 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 86.5 MB in the beginning and 167.4 MB in the end (delta: -80.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.06 ms. Allocated memory is still 203.9 MB. Free memory was 167.4 MB in the beginning and 162.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1335.50 ms. Allocated memory was 203.9 MB in the beginning and 229.6 MB in the end (delta: 25.7 MB). Free memory was 162.8 MB in the beginning and 179.3 MB in the end (delta: -16.5 MB). Peak memory consumption was 88.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14233.39 ms. Allocated memory was 229.6 MB in the beginning and 466.6 MB in the end (delta: 237.0 MB). Free memory was 179.3 MB in the beginning and 216.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 337.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: 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: (((((((((((((!(1 == a21) || (((!(1 == a11) && a17 == \old(a17)) && !(a28 == 8)) && !(a28 == 9))) || ((!(1 == a11) && a17 == \old(a17)) && a19 == 1)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a11 == 1)) || 9 == \old(a28)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || a17 <= 7) || 1 == \old(a25)) || ((a17 == \old(a17) && !(a28 == 8)) && a19 == 1)) || 1 == \old(a11)) || (((!(1 == a11) && a17 == \old(a17)) && !(a25 == 1)) && !(a28 == 9))) || !(1 == \old(a19))) || 8 == \old(a28)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || !(\old(a17) <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 537 SDtfs, 5915 SDslu, 531 SDs, 0 SdLazy, 7244 SolverSat, 1254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 519 GetRequests, 454 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1518occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 71 PreInvPairs, 127 NumberOfFragments, 700 HoareAnnotationTreeSize, 71 FomulaSimplifications, 2676 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1186 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1758 NumberOfCodeBlocks, 1758 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1747 ConstructedInterpolants, 0 QuantifiedInterpolants, 1366878 SizeOfPredicates, 2 NumberOfNonLiveVariables, 968 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 582/612 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...