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/Problem01_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:44:12,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:44:12,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:44:12,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:44:12,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:44:12,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:44:12,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:44:12,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:44:12,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:44:12,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:44:12,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:44:12,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:44:12,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:44:12,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:44:12,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:44:12,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:44:12,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:44:12,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:44:12,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:44:12,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:44:12,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:44:12,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:44:12,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:44:12,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:44:12,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:44:12,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:44:12,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:44:12,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:44:12,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:44:12,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:44:12,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:44:12,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:44:12,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:44:12,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:44:12,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:44:12,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:44:12,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:44:12,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:44:12,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:44:12,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:44:12,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:44:12,941 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:44:12,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:44:12,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:44:12,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:44:12,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:44:12,961 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:44:12,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:44:12,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:44:12,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:44:12,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:44:12,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:44:12,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:44:12,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:44:12,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:44:12,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:44:12,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:44:12,964 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:44:12,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:44:12,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:44:12,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:44:12,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:44:12,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:44:12,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:44:12,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:44:12,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:44:12,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:44:12,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:44:12,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:44:12,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:44:12,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:44:13,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:44:13,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:44:13,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:44:13,018 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:44:13,018 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:44:13,019 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label41.c [2019-10-02 00:44:13,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9769c4f7d/7438bab8114b4ce6a0bb05356cbf3057/FLAGc0ba007a5 [2019-10-02 00:44:13,648 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:44:13,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label41.c [2019-10-02 00:44:13,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9769c4f7d/7438bab8114b4ce6a0bb05356cbf3057/FLAGc0ba007a5 [2019-10-02 00:44:13,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9769c4f7d/7438bab8114b4ce6a0bb05356cbf3057 [2019-10-02 00:44:13,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:44:13,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:44:13,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:44:13,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:44:13,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:44:13,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:44:13" (1/1) ... [2019-10-02 00:44:13,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e611eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:13, skipping insertion in model container [2019-10-02 00:44:13,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:44:13" (1/1) ... [2019-10-02 00:44:13,960 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:44:14,015 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:44:14,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:44:14,524 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:44:14,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:44:14,656 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:44:14,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14 WrapperNode [2019-10-02 00:44:14,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:44:14,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:44:14,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:44:14,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:44:14,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (1/1) ... [2019-10-02 00:44:14,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (1/1) ... [2019-10-02 00:44:14,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (1/1) ... [2019-10-02 00:44:14,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (1/1) ... [2019-10-02 00:44:14,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (1/1) ... [2019-10-02 00:44:14,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (1/1) ... [2019-10-02 00:44:14,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (1/1) ... [2019-10-02 00:44:14,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:44:14,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:44:14,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:44:14,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:44:14,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (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:44:14,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:44:14,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:44:14,825 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:44:14,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:44:14,826 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:44:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:44:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:44:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:44:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:44:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:44:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:44:15,945 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:44:15,946 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:44:15,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:44:15 BoogieIcfgContainer [2019-10-02 00:44:15,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:44:15,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:44:15,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:44:15,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:44:15,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:44:13" (1/3) ... [2019-10-02 00:44:15,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d877369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:44:15, skipping insertion in model container [2019-10-02 00:44:15,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:14" (2/3) ... [2019-10-02 00:44:15,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d877369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:44:15, skipping insertion in model container [2019-10-02 00:44:15,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:44:15" (3/3) ... [2019-10-02 00:44:15,956 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label41.c [2019-10-02 00:44:15,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:44:15,973 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:44:15,989 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:44:16,022 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:44:16,023 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:44:16,023 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:44:16,023 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:44:16,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:44:16,024 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:44:16,024 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:44:16,024 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:44:16,024 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:44:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2019-10-02 00:44:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 00:44:16,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:16,056 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] [2019-10-02 00:44:16,057 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1692915649, now seen corresponding path program 1 times [2019-10-02 00:44:16,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:16,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:16,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:16,472 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:44:16,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:16,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:44:16,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:44:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:44:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:44:16,499 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2019-10-02 00:44:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:17,327 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2019-10-02 00:44:17,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:44:17,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-10-02 00:44:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:17,360 INFO L225 Difference]: With dead ends: 547 [2019-10-02 00:44:17,360 INFO L226 Difference]: Without dead ends: 278 [2019-10-02 00:44:17,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:44:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-02 00:44:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-02 00:44:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-02 00:44:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 400 transitions. [2019-10-02 00:44:17,467 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 400 transitions. Word has length 91 [2019-10-02 00:44:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:17,468 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 400 transitions. [2019-10-02 00:44:17,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:44:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 400 transitions. [2019-10-02 00:44:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 00:44:17,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:17,474 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:17,475 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:17,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1768869960, now seen corresponding path program 1 times [2019-10-02 00:44:17,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:17,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:17,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:17,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:17,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:44:17,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:44:17,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:44:17,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:44:17,621 INFO L87 Difference]: Start difference. First operand 278 states and 400 transitions. Second operand 6 states. [2019-10-02 00:44:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:18,342 INFO L93 Difference]: Finished difference Result 703 states and 1026 transitions. [2019-10-02 00:44:18,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:44:18,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-02 00:44:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:18,349 INFO L225 Difference]: With dead ends: 703 [2019-10-02 00:44:18,350 INFO L226 Difference]: Without dead ends: 431 [2019-10-02 00:44:18,351 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:44:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-02 00:44:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 419. [2019-10-02 00:44:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-02 00:44:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2019-10-02 00:44:18,384 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 101 [2019-10-02 00:44:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:18,385 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2019-10-02 00:44:18,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:44:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2019-10-02 00:44:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 00:44:18,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:18,390 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:18,391 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:18,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1027824070, now seen corresponding path program 1 times [2019-10-02 00:44:18,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:18,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:18,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:18,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:44:18,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:44:18,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:44:18,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:44:18,552 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 3 states. [2019-10-02 00:44:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:19,103 INFO L93 Difference]: Finished difference Result 1241 states and 1781 transitions. [2019-10-02 00:44:19,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:44:19,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-02 00:44:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:19,110 INFO L225 Difference]: With dead ends: 1241 [2019-10-02 00:44:19,110 INFO L226 Difference]: Without dead ends: 828 [2019-10-02 00:44:19,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:44:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-10-02 00:44:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2019-10-02 00:44:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-10-02 00:44:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1140 transitions. [2019-10-02 00:44:19,152 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1140 transitions. Word has length 102 [2019-10-02 00:44:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:19,153 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1140 transitions. [2019-10-02 00:44:19,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:44:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1140 transitions. [2019-10-02 00:44:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 00:44:19,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:19,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:19,161 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1016446174, now seen corresponding path program 1 times [2019-10-02 00:44:19,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:19,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:19,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:19,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:44:19,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:44:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:44:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:44:19,278 INFO L87 Difference]: Start difference. First operand 828 states and 1140 transitions. Second operand 6 states. [2019-10-02 00:44:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:20,096 INFO L93 Difference]: Finished difference Result 2250 states and 3291 transitions. [2019-10-02 00:44:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:44:20,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-02 00:44:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:20,108 INFO L225 Difference]: With dead ends: 2250 [2019-10-02 00:44:20,108 INFO L226 Difference]: Without dead ends: 1428 [2019-10-02 00:44:20,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:44:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-10-02 00:44:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1400. [2019-10-02 00:44:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2019-10-02 00:44:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1852 transitions. [2019-10-02 00:44:20,173 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1852 transitions. Word has length 116 [2019-10-02 00:44:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:20,173 INFO L475 AbstractCegarLoop]: Abstraction has 1400 states and 1852 transitions. [2019-10-02 00:44:20,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:44:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1852 transitions. [2019-10-02 00:44:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 00:44:20,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:20,180 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:20,180 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1605716217, now seen corresponding path program 1 times [2019-10-02 00:44:20,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:20,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:20,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:20,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:20,296 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:44:20,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:20,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 00:44:20,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:20,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:20,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 00:44:20,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:44:20,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:44:20,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:44:20,530 INFO L87 Difference]: Start difference. First operand 1400 states and 1852 transitions. Second operand 7 states. [2019-10-02 00:44:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:21,335 INFO L93 Difference]: Finished difference Result 3245 states and 4457 transitions. [2019-10-02 00:44:21,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:44:21,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2019-10-02 00:44:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:21,347 INFO L225 Difference]: With dead ends: 3245 [2019-10-02 00:44:21,347 INFO L226 Difference]: Without dead ends: 1851 [2019-10-02 00:44:21,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:44:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2019-10-02 00:44:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1541. [2019-10-02 00:44:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2019-10-02 00:44:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2040 transitions. [2019-10-02 00:44:21,413 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2040 transitions. Word has length 133 [2019-10-02 00:44:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:21,414 INFO L475 AbstractCegarLoop]: Abstraction has 1541 states and 2040 transitions. [2019-10-02 00:44:21,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:44:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2040 transitions. [2019-10-02 00:44:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 00:44:21,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:21,419 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:21,419 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1001122943, now seen corresponding path program 1 times [2019-10-02 00:44:21,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:21,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:21,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:21,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:21,524 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:21,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:21,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 00:44:21,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:44:21,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:21,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 00:44:21,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:44:21,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:44:21,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:44:21,706 INFO L87 Difference]: Start difference. First operand 1541 states and 2040 transitions. Second operand 8 states. [2019-10-02 00:44:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:23,352 INFO L93 Difference]: Finished difference Result 3718 states and 5160 transitions. [2019-10-02 00:44:23,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 00:44:23,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2019-10-02 00:44:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:23,367 INFO L225 Difference]: With dead ends: 3718 [2019-10-02 00:44:23,367 INFO L226 Difference]: Without dead ends: 2183 [2019-10-02 00:44:23,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:44:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2019-10-02 00:44:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1712. [2019-10-02 00:44:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2019-10-02 00:44:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2129 transitions. [2019-10-02 00:44:23,446 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2129 transitions. Word has length 137 [2019-10-02 00:44:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:23,446 INFO L475 AbstractCegarLoop]: Abstraction has 1712 states and 2129 transitions. [2019-10-02 00:44:23,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:44:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2129 transitions. [2019-10-02 00:44:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 00:44:23,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:23,453 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:23,453 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:23,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 152592045, now seen corresponding path program 1 times [2019-10-02 00:44:23,454 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:23,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:23,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:23,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:23,595 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:23,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:23,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 00:44:23,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:23,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:23,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 00:44:23,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:44:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:44:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:44:23,735 INFO L87 Difference]: Start difference. First operand 1712 states and 2129 transitions. Second operand 7 states. [2019-10-02 00:44:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:24,493 INFO L93 Difference]: Finished difference Result 4026 states and 5214 transitions. [2019-10-02 00:44:24,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:44:24,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2019-10-02 00:44:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:24,505 INFO L225 Difference]: With dead ends: 4026 [2019-10-02 00:44:24,506 INFO L226 Difference]: Without dead ends: 2320 [2019-10-02 00:44:24,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:44:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2019-10-02 00:44:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2155. [2019-10-02 00:44:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2155 states. [2019-10-02 00:44:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2721 transitions. [2019-10-02 00:44:24,571 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2721 transitions. Word has length 157 [2019-10-02 00:44:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:24,571 INFO L475 AbstractCegarLoop]: Abstraction has 2155 states and 2721 transitions. [2019-10-02 00:44:24,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:44:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2721 transitions. [2019-10-02 00:44:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 00:44:24,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:24,578 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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] [2019-10-02 00:44:24,579 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:24,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash 97285180, now seen corresponding path program 1 times [2019-10-02 00:44:24,579 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:24,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:24,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:24,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:24,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 00:44:24,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:24,721 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:24,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:24,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:44:24,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 00:44:24,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:24,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 00:44:24,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 00:44:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 00:44:24,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:44:24,950 INFO L87 Difference]: Start difference. First operand 2155 states and 2721 transitions. Second operand 9 states. [2019-10-02 00:44:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:27,323 INFO L93 Difference]: Finished difference Result 4869 states and 6514 transitions. [2019-10-02 00:44:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 00:44:27,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-10-02 00:44:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:27,338 INFO L225 Difference]: With dead ends: 4869 [2019-10-02 00:44:27,338 INFO L226 Difference]: Without dead ends: 2720 [2019-10-02 00:44:27,345 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2019-10-02 00:44:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-10-02 00:44:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2604. [2019-10-02 00:44:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2604 states. [2019-10-02 00:44:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 3140 transitions. [2019-10-02 00:44:27,425 INFO L78 Accepts]: Start accepts. Automaton has 2604 states and 3140 transitions. Word has length 173 [2019-10-02 00:44:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:27,425 INFO L475 AbstractCegarLoop]: Abstraction has 2604 states and 3140 transitions. [2019-10-02 00:44:27,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 00:44:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 3140 transitions. [2019-10-02 00:44:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 00:44:27,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:27,433 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:27,434 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1408801773, now seen corresponding path program 1 times [2019-10-02 00:44:27,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:27,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:27,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:27,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:27,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 109 proven. 28 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 00:44:27,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:27,572 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:44:27,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:27,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 00:44:27,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 86 proven. 54 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 00:44:27,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:27,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 00:44:27,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:44:27,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:44:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:44:27,802 INFO L87 Difference]: Start difference. First operand 2604 states and 3140 transitions. Second operand 8 states. [2019-10-02 00:44:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:30,594 INFO L93 Difference]: Finished difference Result 7001 states and 8774 transitions. [2019-10-02 00:44:30,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 00:44:30,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-10-02 00:44:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:30,600 INFO L225 Difference]: With dead ends: 7001 [2019-10-02 00:44:30,600 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:44:30,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:44:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:44:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:44:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:44:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:44:30,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2019-10-02 00:44:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:30,615 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:44:30,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:44:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:44:30,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:44:30,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:44:31,053 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 168 [2019-10-02 00:44:31,326 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 168 [2019-10-02 00:44:32,059 WARN L191 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 49 [2019-10-02 00:44:32,874 WARN L191 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 55 [2019-10-02 00:44:33,793 WARN L191 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 55 [2019-10-02 00:44:33,796 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:44:33,796 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a8~0 |old(~a8~0)|) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2019-10-02 00:44:33,796 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:44:33,796 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-02 00:44:33,797 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-02 00:44:33,797 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,797 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,797 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,797 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,797 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,797 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,797 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-02 00:44:33,798 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-02 00:44:33,798 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-02 00:44:33,798 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-02 00:44:33,799 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-02 00:44:33,800 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-02 00:44:33,800 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-02 00:44:33,800 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-02 00:44:33,800 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-02 00:44:33,800 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-02 00:44:33,800 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,800 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,800 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-02 00:44:33,801 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-02 00:44:33,802 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-02 00:44:33,802 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-02 00:44:33,802 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-02 00:44:33,802 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-02 00:44:33,802 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-02 00:44:33,802 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-02 00:44:33,802 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-02 00:44:33,802 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-02 00:44:33,803 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,804 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-02 00:44:33,805 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-02 00:44:33,806 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,807 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-02 00:44:33,808 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,809 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-02 00:44:33,810 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-02 00:44:33,811 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,811 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,811 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,811 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,811 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,811 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-02 00:44:33,811 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-02 00:44:33,811 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-02 00:44:33,812 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-02 00:44:33,812 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-02 00:44:33,812 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-02 00:44:33,812 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-02 00:44:33,812 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-02 00:44:33,812 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-02 00:44:33,812 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-02 00:44:33,813 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse7 (= 6 |old(~a16~0)|)) (.cse6 (not (<= |old(~a21~0)| 0))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse4 (not (= 1 |old(~a20~0)|))) (.cse11 (= ~a7~0 |old(~a7~0)|)) (.cse16 (= ~a17~0 |old(~a17~0)|)) (.cse12 (= ~a16~0 |old(~a16~0)|)) (.cse13 (= ~a8~0 |old(~a8~0)|)) (.cse14 (= ~a20~0 |old(~a20~0)|)) (.cse15 (= ~a21~0 |old(~a21~0)|))) (let ((.cse2 (= 13 |old(~a8~0)|)) (.cse8 (and .cse11 .cse16 .cse12 .cse13 .cse14 .cse15)) (.cse10 (or .cse0 .cse4)) (.cse5 (not (<= |old(~a17~0)| 0))) (.cse1 (and .cse15 .cse11 .cse16 .cse12 .cse13 .cse14)) (.cse9 (or .cse7 .cse6)) (.cse3 (not (= 1 |old(~a17~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5 .cse6) (or .cse0 .cse2 .cse1 .cse5) (or .cse7 .cse0 .cse8 .cse5) (or .cse9 .cse5 .cse8) (or .cse10 .cse1 .cse3) (or .cse10 .cse5 .cse1) (or (and .cse11 .cse12 .cse13 (= ~a17~0 1) .cse14 .cse15) .cse9 .cse3)))) [2019-10-02 00:44:33,813 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-02 00:44:33,813 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 431) no Hoare annotation was computed. [2019-10-02 00:44:33,813 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,813 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,813 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,813 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,813 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-02 00:44:33,814 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,815 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-02 00:44:33,816 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,817 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-02 00:44:33,818 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-02 00:44:33,819 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:44:33,819 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a17~0 1) (= ~a21~0 1) (= ~a20~0 1) (not (= ~a8~0 13)) (= ~a16~0 5)) [2019-10-02 00:44:33,819 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:44:33,819 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:44:33,819 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 |old(~a21~0)|) (= ~a7~0 |old(~a7~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a8~0 |old(~a8~0)|) (= ~a20~0 |old(~a20~0)|) (= ~a16~0 5)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (= 13 |old(~a8~0)|) (not (= 1 |old(~a17~0)|))) [2019-10-02 00:44:33,819 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-02 00:44:33,819 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse9 (= ~a20~0 1)) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse8 (= ~a21~0 1))) (let ((.cse2 (not (= ~a16~0 6))) (.cse6 (and .cse8 (not (= ~a8~0 13)))) (.cse1 (<= ~a21~0 0)) (.cse7 (<= ~a17~0 0)) (.cse4 (or .cse0 (not (= 1 |old(~a7~0)|)))) (.cse3 (= ~a17~0 1)) (.cse5 (and .cse8 .cse9))) (or .cse0 (and (and .cse1 .cse2 .cse3) .cse4) (not (= 1 |old(~a20~0)|)) (and (= ~a7~0 |old(~a7~0)|) (and .cse5 .cse3) (= ~a16~0 5)) (not (= 5 |old(~a16~0)|)) (and (and .cse6 .cse3) .cse4) (and .cse1 .cse2 .cse4 .cse7) (and .cse2 .cse4 .cse7 .cse8) (= 13 |old(~a8~0)|) (and .cse6 .cse4 .cse7) (not (= 1 |old(~a17~0)|)) (and .cse1 .cse4 .cse7 .cse9) (and .cse5 .cse4 .cse7) (and .cse4 .cse3 .cse5)))) [2019-10-02 00:44:33,819 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-02 00:44:33,819 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-02 00:44:33,820 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a20~0 1)) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse8 (= ~a21~0 1))) (let ((.cse2 (not (= ~a16~0 6))) (.cse6 (and .cse8 (not (= ~a8~0 13)))) (.cse1 (<= ~a21~0 0)) (.cse7 (<= ~a17~0 0)) (.cse4 (or .cse0 (not (= 1 |old(~a7~0)|)))) (.cse3 (= ~a17~0 1)) (.cse5 (and .cse8 .cse9))) (or .cse0 (and (and .cse1 .cse2 .cse3) .cse4) (not (= 1 |old(~a20~0)|)) (and (= ~a7~0 |old(~a7~0)|) (and .cse5 .cse3) (= ~a16~0 5)) (not (= 5 |old(~a16~0)|)) (and (and .cse6 .cse3) .cse4) (and .cse1 .cse2 .cse4 .cse7) (and .cse2 .cse4 .cse7 .cse8) (= 13 |old(~a8~0)|) (and .cse6 .cse4 .cse7) (not (= 1 |old(~a17~0)|)) (and .cse1 .cse4 .cse7 .cse9) (and .cse5 .cse4 .cse7) (and .cse4 .cse3 .cse5)))) [2019-10-02 00:44:33,820 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-02 00:44:33,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:44:33 BoogieIcfgContainer [2019-10-02 00:44:33,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:44:33,841 INFO L168 Benchmark]: Toolchain (without parser) took 19896.95 ms. Allocated memory was 130.5 MB in the beginning and 620.8 MB in the end (delta: 490.2 MB). Free memory was 83.5 MB in the beginning and 543.0 MB in the end (delta: -459.5 MB). Peak memory consumption was 437.4 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:33,842 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 130.5 MB. Free memory was 103.4 MB in the beginning and 103.2 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:44:33,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.75 ms. Allocated memory was 130.5 MB in the beginning and 198.2 MB in the end (delta: 67.6 MB). Free memory was 83.3 MB in the beginning and 155.4 MB in the end (delta: -72.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:33,844 INFO L168 Benchmark]: Boogie Preprocessor took 95.89 ms. Allocated memory is still 198.2 MB. Free memory was 155.4 MB in the beginning and 150.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:33,845 INFO L168 Benchmark]: RCFGBuilder took 1193.59 ms. Allocated memory was 198.2 MB in the beginning and 218.1 MB in the end (delta: 19.9 MB). Free memory was 150.7 MB in the beginning and 163.5 MB in the end (delta: -12.9 MB). Peak memory consumption was 88.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:33,846 INFO L168 Benchmark]: TraceAbstraction took 17891.13 ms. Allocated memory was 218.1 MB in the beginning and 620.8 MB in the end (delta: 402.7 MB). Free memory was 163.5 MB in the beginning and 543.0 MB in the end (delta: -379.5 MB). Peak memory consumption was 429.9 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:33,850 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 130.5 MB. Free memory was 103.4 MB in the beginning and 103.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 711.75 ms. Allocated memory was 130.5 MB in the beginning and 198.2 MB in the end (delta: 67.6 MB). Free memory was 83.3 MB in the beginning and 155.4 MB in the end (delta: -72.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.89 ms. Allocated memory is still 198.2 MB. Free memory was 155.4 MB in the beginning and 150.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1193.59 ms. Allocated memory was 198.2 MB in the beginning and 218.1 MB in the end (delta: 19.9 MB). Free memory was 150.7 MB in the beginning and 163.5 MB in the end (delta: -12.9 MB). Peak memory consumption was 88.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17891.13 ms. Allocated memory was 218.1 MB in the beginning and 620.8 MB in the end (delta: 402.7 MB). Free memory was 163.5 MB in the beginning and 543.0 MB in the end (delta: -379.5 MB). Peak memory consumption was 429.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 431]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == \old(a21)) || (((a21 <= 0 && !(a16 == 6)) && a17 == 1) && (!(1 == \old(a21)) || !(1 == \old(a7))))) || !(1 == \old(a20))) || ((a7 == \old(a7) && (a21 == 1 && a20 == 1) && a17 == 1) && a16 == 5)) || !(5 == \old(a16))) || (((a21 == 1 && !(a8 == 13)) && a17 == 1) && (!(1 == \old(a21)) || !(1 == \old(a7))))) || (((a21 <= 0 && !(a16 == 6)) && (!(1 == \old(a21)) || !(1 == \old(a7)))) && a17 <= 0)) || (((!(a16 == 6) && (!(1 == \old(a21)) || !(1 == \old(a7)))) && a17 <= 0) && a21 == 1)) || 13 == \old(a8)) || (((a21 == 1 && !(a8 == 13)) && (!(1 == \old(a21)) || !(1 == \old(a7)))) && a17 <= 0)) || !(1 == \old(a17))) || (((a21 <= 0 && (!(1 == \old(a21)) || !(1 == \old(a7)))) && a17 <= 0) && a20 == 1)) || (((a21 == 1 && a20 == 1) && (!(1 == \old(a21)) || !(1 == \old(a7)))) && a17 <= 0)) || (((!(1 == \old(a21)) || !(1 == \old(a7))) && a17 == 1) && a21 == 1 && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 17.8s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 4429 SDslu, 543 SDs, 0 SdLazy, 8856 SolverSat, 1636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 944 GetRequests, 844 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2604occurred 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1102 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 121 PreInvPairs, 197 NumberOfFragments, 734 HoareAnnotationTreeSize, 121 FomulaSimplifications, 80280 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15646 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2000 NumberOfCodeBlocks, 2000 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1986 ConstructedInterpolants, 0 QuantifiedInterpolants, 667073 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2376 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 809/939 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...