./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label03_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label03_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79d76b935496dc6a959c1e4984dc143bd47f9882 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:54:36,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:54:36,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:54:36,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:54:36,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:54:36,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:54:36,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:54:36,864 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:54:36,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:54:36,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:54:36,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:54:36,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:54:36,869 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:54:36,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:54:36,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:54:36,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:54:36,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:54:36,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:54:36,878 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:54:36,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:54:36,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:54:36,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:54:36,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:54:36,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:54:36,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:54:36,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:54:36,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:54:36,889 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:54:36,890 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:54:36,891 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:54:36,892 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:54:36,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:54:36,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:54:36,893 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:54:36,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:54:36,895 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:54:36,896 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:54:36,916 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:54:36,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:54:36,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:54:36,925 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:54:36,925 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:54:36,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:54:36,926 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:54:36,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:54:36,926 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:54:36,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:54:36,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:54:36,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:54:36,927 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:54:36,927 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:54:36,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:54:36,927 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:54:36,928 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:54:36,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:54:36,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:54:36,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:54:36,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:54:36,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:54:36,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:54:36,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:54:36,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:54:36,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:54:36,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:54:36,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:54:36,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79d76b935496dc6a959c1e4984dc143bd47f9882 [2019-01-12 00:54:36,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:54:36,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:54:36,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:54:36,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:54:36,988 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:54:36,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label03_true-unreach-call_false-termination.c [2019-01-12 00:54:37,051 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239e3ab9a/76c93d0d53a5470a9f6a60c9bcfe2bc9/FLAG30f97e397 [2019-01-12 00:54:37,620 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:54:37,620 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label03_true-unreach-call_false-termination.c [2019-01-12 00:54:37,638 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239e3ab9a/76c93d0d53a5470a9f6a60c9bcfe2bc9/FLAG30f97e397 [2019-01-12 00:54:37,871 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239e3ab9a/76c93d0d53a5470a9f6a60c9bcfe2bc9 [2019-01-12 00:54:37,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:54:37,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:54:37,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:54:37,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:54:37,881 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:54:37,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:54:37" (1/1) ... [2019-01-12 00:54:37,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be1244e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:37, skipping insertion in model container [2019-01-12 00:54:37,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:54:37" (1/1) ... [2019-01-12 00:54:37,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:54:37,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:54:38,317 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:54:38,326 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:54:38,438 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:54:38,460 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:54:38,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38 WrapperNode [2019-01-12 00:54:38,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:54:38,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:38,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:54:38,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:54:38,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:38,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:54:38,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:54:38,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:54:38,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:54:38,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:54:38,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:54:38,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:54:38,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (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-01-12 00:54:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:54:38,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:54:41,980 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:54:41,981 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:54:41,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:41 BoogieIcfgContainer [2019-01-12 00:54:41,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:54:41,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:54:41,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:54:41,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:54:41,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:54:37" (1/3) ... [2019-01-12 00:54:41,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3938fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:41, skipping insertion in model container [2019-01-12 00:54:41,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (2/3) ... [2019-01-12 00:54:41,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3938fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:41, skipping insertion in model container [2019-01-12 00:54:41,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:41" (3/3) ... [2019-01-12 00:54:41,990 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label03_true-unreach-call_false-termination.c [2019-01-12 00:54:42,000 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:54:42,010 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:54:42,025 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:54:42,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:54:42,062 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:54:42,063 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:54:42,063 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:54:42,063 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:54:42,063 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:54:42,064 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:54:42,064 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:54:42,064 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:54:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:54:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 00:54:42,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:42,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:42,106 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:42,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2099114005, now seen corresponding path program 1 times [2019-01-12 00:54:42,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:42,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:42,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:42,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:42,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:42,684 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:54:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:42,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:42,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:42,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:42,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:42,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:42,770 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:54:46,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:46,151 INFO L93 Difference]: Finished difference Result 746 states and 1322 transitions. [2019-01-12 00:54:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:46,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-01-12 00:54:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:46,173 INFO L225 Difference]: With dead ends: 746 [2019-01-12 00:54:46,173 INFO L226 Difference]: Without dead ends: 452 [2019-01-12 00:54:46,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-01-12 00:54:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 449. [2019-01-12 00:54:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-01-12 00:54:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 609 transitions. [2019-01-12 00:54:46,248 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 609 transitions. Word has length 129 [2019-01-12 00:54:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:46,249 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 609 transitions. [2019-01-12 00:54:46,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 609 transitions. [2019-01-12 00:54:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-12 00:54:46,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:46,255 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:46,255 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1254611531, now seen corresponding path program 1 times [2019-01-12 00:54:46,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:46,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:46,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:46,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:46,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:46,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:46,427 INFO L87 Difference]: Start difference. First operand 449 states and 609 transitions. Second operand 3 states. [2019-01-12 00:54:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:47,466 INFO L93 Difference]: Finished difference Result 1040 states and 1422 transitions. [2019-01-12 00:54:47,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:47,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-01-12 00:54:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:47,476 INFO L225 Difference]: With dead ends: 1040 [2019-01-12 00:54:47,476 INFO L226 Difference]: Without dead ends: 593 [2019-01-12 00:54:47,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-01-12 00:54:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 592. [2019-01-12 00:54:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-01-12 00:54:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 767 transitions. [2019-01-12 00:54:47,508 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 767 transitions. Word has length 138 [2019-01-12 00:54:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:47,509 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 767 transitions. [2019-01-12 00:54:47,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 767 transitions. [2019-01-12 00:54:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-12 00:54:47,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:47,514 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:47,515 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -393009665, now seen corresponding path program 1 times [2019-01-12 00:54:47,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:47,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:47,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:47,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:47,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:47,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:47,626 INFO L87 Difference]: Start difference. First operand 592 states and 767 transitions. Second operand 3 states. [2019-01-12 00:54:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:48,443 INFO L93 Difference]: Finished difference Result 1324 states and 1736 transitions. [2019-01-12 00:54:48,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:48,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-01-12 00:54:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:48,449 INFO L225 Difference]: With dead ends: 1324 [2019-01-12 00:54:48,449 INFO L226 Difference]: Without dead ends: 734 [2019-01-12 00:54:48,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-12 00:54:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-01-12 00:54:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 733. [2019-01-12 00:54:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-01-12 00:54:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 918 transitions. [2019-01-12 00:54:48,471 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 918 transitions. Word has length 142 [2019-01-12 00:54:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:48,472 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 918 transitions. [2019-01-12 00:54:48,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 918 transitions. [2019-01-12 00:54:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-12 00:54:48,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:48,476 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:48,476 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash -82222576, now seen corresponding path program 1 times [2019-01-12 00:54:48,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:48,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:48,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:48,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:48,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 00:54:48,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:48,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:54:48,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:48,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:48,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:48,573 INFO L87 Difference]: Start difference. First operand 733 states and 918 transitions. Second operand 3 states. [2019-01-12 00:54:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:50,820 INFO L93 Difference]: Finished difference Result 2025 states and 2561 transitions. [2019-01-12 00:54:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:50,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-01-12 00:54:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:50,828 INFO L225 Difference]: With dead ends: 2025 [2019-01-12 00:54:50,828 INFO L226 Difference]: Without dead ends: 1294 [2019-01-12 00:54:50,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-12 00:54:50,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-01-12 00:54:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2019-01-12 00:54:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-01-12 00:54:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1584 transitions. [2019-01-12 00:54:50,856 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1584 transitions. Word has length 150 [2019-01-12 00:54:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:50,857 INFO L480 AbstractCegarLoop]: Abstraction has 1294 states and 1584 transitions. [2019-01-12 00:54:50,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1584 transitions. [2019-01-12 00:54:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 00:54:50,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:50,861 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:54:50,861 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1257335336, now seen corresponding path program 1 times [2019-01-12 00:54:50,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:50,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:51,289 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-12 00:54:51,552 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-12 00:54:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:51,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:51,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 00:54:51,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 00:54:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 00:54:51,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:54:51,670 INFO L87 Difference]: Start difference. First operand 1294 states and 1584 transitions. Second operand 10 states. [2019-01-12 00:54:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:53,069 INFO L93 Difference]: Finished difference Result 3512 states and 4258 transitions. [2019-01-12 00:54:53,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 00:54:53,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2019-01-12 00:54:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:53,081 INFO L225 Difference]: With dead ends: 3512 [2019-01-12 00:54:53,082 INFO L226 Difference]: Without dead ends: 2220 [2019-01-12 00:54:53,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:54:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-01-12 00:54:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1653. [2019-01-12 00:54:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-01-12 00:54:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 1966 transitions. [2019-01-12 00:54:53,122 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 1966 transitions. Word has length 159 [2019-01-12 00:54:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:53,123 INFO L480 AbstractCegarLoop]: Abstraction has 1653 states and 1966 transitions. [2019-01-12 00:54:53,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 00:54:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1966 transitions. [2019-01-12 00:54:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-12 00:54:53,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:53,129 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:53,129 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:53,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1956209418, now seen corresponding path program 1 times [2019-01-12 00:54:53,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:53,384 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:54:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-01-12 00:54:53,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:53,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:54:53,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:53,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:53,487 INFO L87 Difference]: Start difference. First operand 1653 states and 1966 transitions. Second operand 4 states. [2019-01-12 00:54:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:54,707 INFO L93 Difference]: Finished difference Result 4007 states and 4789 transitions. [2019-01-12 00:54:54,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:54,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-01-12 00:54:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:54,718 INFO L225 Difference]: With dead ends: 4007 [2019-01-12 00:54:54,719 INFO L226 Difference]: Without dead ends: 1924 [2019-01-12 00:54:54,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2019-01-12 00:54:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1922. [2019-01-12 00:54:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2019-01-12 00:54:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2124 transitions. [2019-01-12 00:54:54,759 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2124 transitions. Word has length 204 [2019-01-12 00:54:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:54,759 INFO L480 AbstractCegarLoop]: Abstraction has 1922 states and 2124 transitions. [2019-01-12 00:54:54,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2124 transitions. [2019-01-12 00:54:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-12 00:54:54,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:54,765 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:54,766 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1945288329, now seen corresponding path program 1 times [2019-01-12 00:54:54,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:54,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:54,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:54,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:54,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 00:54:54,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:54,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:54,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:54,924 INFO L87 Difference]: Start difference. First operand 1922 states and 2124 transitions. Second operand 3 states. [2019-01-12 00:54:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:55,738 INFO L93 Difference]: Finished difference Result 4821 states and 5380 transitions. [2019-01-12 00:54:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:55,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-01-12 00:54:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:55,751 INFO L225 Difference]: With dead ends: 4821 [2019-01-12 00:54:55,752 INFO L226 Difference]: Without dead ends: 2198 [2019-01-12 00:54:55,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-12 00:54:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-01-12 00:54:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1918. [2019-01-12 00:54:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-01-12 00:54:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2093 transitions. [2019-01-12 00:54:55,791 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2093 transitions. Word has length 205 [2019-01-12 00:54:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:55,791 INFO L480 AbstractCegarLoop]: Abstraction has 1918 states and 2093 transitions. [2019-01-12 00:54:55,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2093 transitions. [2019-01-12 00:54:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-01-12 00:54:55,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:55,798 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:55,798 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash 233226314, now seen corresponding path program 1 times [2019-01-12 00:54:55,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:55,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:55,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:55,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:55,922 INFO L87 Difference]: Start difference. First operand 1918 states and 2093 transitions. Second operand 3 states. [2019-01-12 00:54:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:56,340 INFO L93 Difference]: Finished difference Result 3832 states and 4182 transitions. [2019-01-12 00:54:56,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:56,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-01-12 00:54:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:56,348 INFO L225 Difference]: With dead ends: 3832 [2019-01-12 00:54:56,349 INFO L226 Difference]: Without dead ends: 1916 [2019-01-12 00:54:56,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-12 00:54:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2019-01-12 00:54:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1775. [2019-01-12 00:54:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-01-12 00:54:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1906 transitions. [2019-01-12 00:54:56,387 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1906 transitions. Word has length 218 [2019-01-12 00:54:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:56,388 INFO L480 AbstractCegarLoop]: Abstraction has 1775 states and 1906 transitions. [2019-01-12 00:54:56,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1906 transitions. [2019-01-12 00:54:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-01-12 00:54:56,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:56,393 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:54:56,394 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash -960693472, now seen corresponding path program 1 times [2019-01-12 00:54:56,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:56,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:56,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-12 00:54:56,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:56,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:54:56,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:56,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:56,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:56,722 INFO L87 Difference]: Start difference. First operand 1775 states and 1906 transitions. Second operand 4 states. [2019-01-12 00:54:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:58,703 INFO L93 Difference]: Finished difference Result 3402 states and 3656 transitions. [2019-01-12 00:54:58,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:58,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-01-12 00:54:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:58,708 INFO L225 Difference]: With dead ends: 3402 [2019-01-12 00:54:58,709 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:54:58,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:54:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:54:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:54:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:54:58,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2019-01-12 00:54:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:58,718 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:54:58,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:54:58,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:54:58,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:54:58,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:54:58,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:01,434 WARN L181 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-12 00:55:01,635 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-12 00:55:01,638 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,638 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,638 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,638 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:55:01,638 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:55:01,638 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:55:01,638 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:55:01,639 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:55:01,640 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:55:01,641 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 559) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:55:01,642 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,643 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,644 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,645 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:55:01,646 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,647 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:01,648 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:55:01,649 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:55:01,650 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:55:01,650 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:01,650 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:01,650 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:55:01,650 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a11~0 1)) (.cse6 (= ~a25~0 1))) (let ((.cse2 (<= ~a19~0 0)) (.cse0 (not .cse6)) (.cse5 (not .cse1)) (.cse3 (not (= ~a28~0 11))) (.cse4 (= ~a19~0 1))) (or (and (= ~a28~0 10) .cse0 .cse1) (and .cse2 .cse3) (and (= ~a17~0 8) .cse4 (= ~a21~0 1) .cse3) (and .cse2 .cse0 .cse5) (and (<= 10 ~a28~0) .cse4 .cse1) (and .cse4 .cse5 (not (= ~a28~0 9)) .cse3) (and (<= 11 ~a28~0) .cse4 .cse6) (and (= ~a28~0 7) .cse1)))) [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,651 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,652 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,653 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:01,653 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:01,653 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:55:01,653 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:55:01,653 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:55:01,653 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:55:01,653 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a11~0 1)) (.cse6 (= ~a25~0 1))) (let ((.cse2 (<= ~a19~0 0)) (.cse0 (not .cse6)) (.cse5 (not .cse1)) (.cse3 (not (= ~a28~0 11))) (.cse4 (= ~a19~0 1))) (or (and (= ~a28~0 10) .cse0 .cse1) (and .cse2 .cse3) (and (= ~a17~0 8) .cse4 (= ~a21~0 1) .cse3) (and .cse2 .cse0 .cse5) (and (<= 10 ~a28~0) .cse4 .cse1) (and .cse4 .cse5 (not (= ~a28~0 9)) .cse3) (and (<= 11 ~a28~0) .cse4 .cse6) (and (= ~a28~0 7) .cse1)))) [2019-01-12 00:55:01,653 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,653 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:55:01,654 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:55:01,655 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:55:01,656 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:55:01,657 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:55:01,658 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,659 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:55:01,660 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:01,661 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:55:01,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:55:01 BoogieIcfgContainer [2019-01-12 00:55:01,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:55:01,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:55:01,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:55:01,703 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:55:01,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:41" (3/4) ... [2019-01-12 00:55:01,708 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:55:01,750 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:55:01,752 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:55:01,915 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:55:01,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:55:01,917 INFO L168 Benchmark]: Toolchain (without parser) took 24040.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -209.0 MB). Peak memory consumption was 181.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:01,917 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:55:01,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.88 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:01,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 187.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -218.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:01,919 INFO L168 Benchmark]: Boogie Preprocessor took 114.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:01,920 INFO L168 Benchmark]: RCFGBuilder took 3217.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:01,920 INFO L168 Benchmark]: TraceAbstraction took 19716.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -156.9 MB). Peak memory consumption was 84.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:01,920 INFO L168 Benchmark]: Witness Printer took 213.08 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:01,925 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 582.88 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 187.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -218.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3217.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19716.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -156.9 MB). Peak memory consumption was 84.8 MB. Max. memory is 11.5 GB. * Witness Printer took 213.08 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 559]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((a28 == 10 && !(a25 == 1)) && a11 == 1) || (a19 <= 0 && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || ((a19 <= 0 && !(a25 == 1)) && !(a11 == 1))) || ((10 <= a28 && a19 == 1) && a11 == 1)) || (((a19 == 1 && !(a11 == 1)) && !(a28 == 9)) && !(a28 == 11))) || ((11 <= a28 && a19 == 1) && a25 == 1)) || (a28 == 7 && a11 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((a28 == 10 && !(a25 == 1)) && a11 == 1) || (a19 <= 0 && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || ((a19 <= 0 && !(a25 == 1)) && !(a11 == 1))) || ((10 <= a28 && a19 == 1) && a11 == 1)) || (((a19 == 1 && !(a11 == 1)) && !(a28 == 9)) && !(a28 == 11))) || ((11 <= a28 && a19 == 1) && a25 == 1)) || (a28 == 7 && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 19.6s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1184 SDtfs, 2155 SDslu, 216 SDs, 0 SdLazy, 4592 SolverSat, 899 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1922occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 995 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 179 HoareAnnotationTreeSize, 3 FomulaSimplifications, 868 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 112 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1572 NumberOfCodeBlocks, 1572 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1563 ConstructedInterpolants, 0 QuantifiedInterpolants, 859256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 574/574 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...