./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label39_true-unreach-call.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/Problem10_label39_true-unreach-call.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 0fc1a5d7bced8b0772de8cf3eb4e884f73b18851 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:32:05,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:32:05,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:32:05,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:32:05,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:32:05,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:32:05,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:32:05,112 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:32:05,114 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:32:05,115 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:32:05,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:32:05,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:32:05,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:32:05,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:32:05,120 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:32:05,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:32:05,121 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:32:05,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:32:05,126 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:32:05,128 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:32:05,129 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:32:05,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:32:05,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:32:05,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:32:05,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:32:05,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:32:05,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:32:05,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:32:05,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:32:05,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:32:05,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:32:05,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:32:05,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:32:05,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:32:05,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:32:05,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:32:05,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:32:05,161 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:32:05,161 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:32:05,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:32:05,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:32:05,163 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:32:05,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:32:05,164 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:32:05,164 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:32:05,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:32:05,164 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:32:05,164 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:32:05,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:32:05,165 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:32:05,166 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:32:05,166 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:32:05,166 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:32:05,166 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:32:05,166 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:32:05,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:32:05,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:32:05,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:32:05,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:32:05,167 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:32:05,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:32:05,169 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:32:05,169 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:32:05,169 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:32:05,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:32:05,170 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 -> 0fc1a5d7bced8b0772de8cf3eb4e884f73b18851 [2019-01-12 03:32:05,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:32:05,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:32:05,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:32:05,235 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:32:05,236 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:32:05,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label39_true-unreach-call.c [2019-01-12 03:32:05,304 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3df77c6/2e8ae4c6f1524b268e888c57e3e122a9/FLAGce7b8e4c7 [2019-01-12 03:32:05,882 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:32:05,884 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label39_true-unreach-call.c [2019-01-12 03:32:05,902 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3df77c6/2e8ae4c6f1524b268e888c57e3e122a9/FLAGce7b8e4c7 [2019-01-12 03:32:06,131 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3df77c6/2e8ae4c6f1524b268e888c57e3e122a9 [2019-01-12 03:32:06,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:32:06,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:32:06,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:32:06,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:32:06,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:32:06,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:06,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7290c9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06, skipping insertion in model container [2019-01-12 03:32:06,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:06,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:32:06,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:32:06,765 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:32:06,772 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:32:06,926 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:32:06,948 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:32:06,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06 WrapperNode [2019-01-12 03:32:06,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:32:06,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:32:06,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:32:06,951 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:32:07,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:32:07,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:32:07,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:32:07,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:32:07,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (1/1) ... [2019-01-12 03:32:07,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:32:07,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:32:07,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:32:07,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:32:07,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (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 03:32:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:32:07,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:32:10,399 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:32:10,400 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:32:10,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:10 BoogieIcfgContainer [2019-01-12 03:32:10,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:32:10,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:32:10,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:32:10,411 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:32:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:32:06" (1/3) ... [2019-01-12 03:32:10,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2098e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:32:10, skipping insertion in model container [2019-01-12 03:32:10,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:06" (2/3) ... [2019-01-12 03:32:10,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2098e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:32:10, skipping insertion in model container [2019-01-12 03:32:10,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:10" (3/3) ... [2019-01-12 03:32:10,420 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label39_true-unreach-call.c [2019-01-12 03:32:10,434 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:32:10,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:32:10,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:32:10,498 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:32:10,499 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:32:10,499 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:32:10,499 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:32:10,500 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:32:10,500 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:32:10,501 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:32:10,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:32:10,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:32:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:32:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 03:32:10,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:10,537 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] [2019-01-12 03:32:10,540 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:10,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:10,547 INFO L82 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2019-01-12 03:32:10,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:10,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:10,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:10,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:10,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:10,961 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 03:32:10,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:10,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:10,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:10,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:10,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:10,992 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-12 03:32:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:13,760 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-01-12 03:32:13,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:13,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-12 03:32:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:13,782 INFO L225 Difference]: With dead ends: 694 [2019-01-12 03:32:13,782 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 03:32:13,787 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 03:32:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 03:32:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-01-12 03:32:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 03:32:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-01-12 03:32:13,853 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 26 [2019-01-12 03:32:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:13,855 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-01-12 03:32:13,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-01-12 03:32:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 03:32:13,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:13,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:13,862 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1630871965, now seen corresponding path program 1 times [2019-01-12 03:32:13,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:13,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:13,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:14,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:14,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:14,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:14,161 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-01-12 03:32:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:15,506 INFO L93 Difference]: Finished difference Result 840 states and 1290 transitions. [2019-01-12 03:32:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:15,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-12 03:32:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:15,513 INFO L225 Difference]: With dead ends: 840 [2019-01-12 03:32:15,513 INFO L226 Difference]: Without dead ends: 560 [2019-01-12 03:32:15,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-01-12 03:32:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2019-01-12 03:32:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:32:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2019-01-12 03:32:15,561 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 95 [2019-01-12 03:32:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:15,563 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2019-01-12 03:32:15,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2019-01-12 03:32:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 03:32:15,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:15,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:15,568 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash 446653076, now seen corresponding path program 1 times [2019-01-12 03:32:15,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:15,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:15,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:15,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:15,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:32:15,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:15,835 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand 4 states. [2019-01-12 03:32:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:17,566 INFO L93 Difference]: Finished difference Result 1535 states and 2162 transitions. [2019-01-12 03:32:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:17,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 03:32:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:17,575 INFO L225 Difference]: With dead ends: 1535 [2019-01-12 03:32:17,575 INFO L226 Difference]: Without dead ends: 1116 [2019-01-12 03:32:17,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 03:32:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-01-12 03:32:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 838. [2019-01-12 03:32:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-01-12 03:32:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1108 transitions. [2019-01-12 03:32:17,615 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1108 transitions. Word has length 101 [2019-01-12 03:32:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:17,615 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1108 transitions. [2019-01-12 03:32:17,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1108 transitions. [2019-01-12 03:32:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-12 03:32:17,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:17,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:17,622 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2087183421, now seen corresponding path program 1 times [2019-01-12 03:32:17,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:17,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:17,973 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 03:32:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:18,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:18,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:18,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:18,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:18,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:18,011 INFO L87 Difference]: Start difference. First operand 838 states and 1108 transitions. Second operand 4 states. [2019-01-12 03:32:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:20,470 INFO L93 Difference]: Finished difference Result 1813 states and 2398 transitions. [2019-01-12 03:32:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:20,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-01-12 03:32:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:20,481 INFO L225 Difference]: With dead ends: 1813 [2019-01-12 03:32:20,482 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 03:32:20,484 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 03:32:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 03:32:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-01-12 03:32:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:32:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1152 transitions. [2019-01-12 03:32:20,511 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1152 transitions. Word has length 134 [2019-01-12 03:32:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:20,513 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1152 transitions. [2019-01-12 03:32:20,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1152 transitions. [2019-01-12 03:32:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 03:32:20,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:20,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:20,521 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1855801739, now seen corresponding path program 1 times [2019-01-12 03:32:20,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:20,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:20,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:20,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:20,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:20,924 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 03:32:21,398 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-12 03:32:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:21,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:21,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 03:32:21,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:32:21,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:32:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:32:21,699 INFO L87 Difference]: Start difference. First operand 977 states and 1152 transitions. Second operand 8 states. [2019-01-12 03:32:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:23,138 INFO L93 Difference]: Finished difference Result 2105 states and 2465 transitions. [2019-01-12 03:32:23,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:32:23,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 139 [2019-01-12 03:32:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:23,147 INFO L225 Difference]: With dead ends: 2105 [2019-01-12 03:32:23,147 INFO L226 Difference]: Without dead ends: 1130 [2019-01-12 03:32:23,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:32:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-01-12 03:32:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1116. [2019-01-12 03:32:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-01-12 03:32:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1296 transitions. [2019-01-12 03:32:23,175 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1296 transitions. Word has length 139 [2019-01-12 03:32:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:23,176 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1296 transitions. [2019-01-12 03:32:23,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:32:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1296 transitions. [2019-01-12 03:32:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-12 03:32:23,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:23,181 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:23,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash 282954665, now seen corresponding path program 1 times [2019-01-12 03:32:23,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:23,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:23,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:23,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:23,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:32:23,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:23,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:32:23,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:23,454 INFO L87 Difference]: Start difference. First operand 1116 states and 1296 transitions. Second operand 4 states. [2019-01-12 03:32:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:25,867 INFO L93 Difference]: Finished difference Result 3618 states and 4285 transitions. [2019-01-12 03:32:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:25,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-01-12 03:32:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:25,870 INFO L225 Difference]: With dead ends: 3618 [2019-01-12 03:32:25,870 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:32:25,875 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 03:32:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:32:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:32:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:32:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:32:25,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2019-01-12 03:32:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:25,876 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:32:25,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:32:25,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:32:25,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:32:25,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:32:25,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:32:25,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:32:25,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:32:25,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:32:27,014 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2019-01-12 03:32:27,177 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2019-01-12 03:32:27,181 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:32:27,182 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,182 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,182 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,182 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,182 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,182 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:32:27,183 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,184 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:32:27,185 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:32:27,188 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:32:27,188 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:32:27,188 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:32:27,188 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:32:27,188 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:32:27,188 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:32:27,188 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:32:27,188 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,189 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,190 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:32:27,190 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:32:27,190 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:32:27,190 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:32:27,190 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:32:27,190 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse0 (= ~a10~0 0))) (or (and (not (= ~a19~0 10)) (not .cse0)) (and .cse0 (not (= ~a19~0 8))) (and .cse0 (< 0 (+ ~a1~0 13))) (= ~a10~0 1))) [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,191 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:32:27,192 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,193 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,194 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:32:27,195 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:32:27,196 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:32:27,196 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:32:27,196 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:32:27,196 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:32:27,196 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:32:27,196 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (= ~a10~0 0))) (or (and (not (= ~a19~0 10)) (not .cse0)) (and .cse0 (not (= ~a19~0 8))) (and .cse0 (< 0 (+ ~a1~0 13))) (= ~a10~0 1))) [2019-01-12 03:32:27,196 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:32:27,196 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:32:27,197 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:32:27,198 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,199 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,199 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,199 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,199 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,199 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,199 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:32:27,199 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:32:27,200 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:32:27,200 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:32:27,200 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:32:27,200 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:32:27,200 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:32:27,200 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:32:27,200 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:32:27,200 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,201 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:32:27,202 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,203 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:32:27,204 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,205 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:32:27,206 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:32:27,207 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:32:27,207 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:32:27,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:32:27 BoogieIcfgContainer [2019-01-12 03:32:27,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:32:27,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:32:27,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:32:27,232 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:32:27,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:10" (3/4) ... [2019-01-12 03:32:27,242 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:32:27,266 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:32:27,268 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:32:27,438 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:32:27,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:32:27,439 INFO L168 Benchmark]: Toolchain (without parser) took 21302.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 159.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:27,441 INFO L168 Benchmark]: CDTParser took 0.17 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 03:32:27,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.78 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:27,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 201.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:27,442 INFO L168 Benchmark]: Boogie Preprocessor took 98.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:32:27,443 INFO L168 Benchmark]: RCFGBuilder took 3152.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.8 MB in the end (delta: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:27,443 INFO L168 Benchmark]: TraceAbstraction took 16825.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 996.8 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:27,444 INFO L168 Benchmark]: Witness Printer took 206.44 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:27,447 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.17 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 810.78 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 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 201.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3152.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.8 MB in the end (delta: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16825.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 996.8 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. * Witness Printer took 206.44 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 82]: 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: 582]: Loop Invariant Derived loop invariant: (((!(a19 == 10) && !(a10 == 0)) || (a10 == 0 && !(a19 == 8))) || (a10 == 0 && 0 < a1 + 13)) || a10 == 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((!(a19 == 10) && !(a10 == 0)) || (a10 == 0 && !(a19 == 8))) || (a10 == 0 && 0 < a1 + 13)) || a10 == 1 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 16.7s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 489 SDtfs, 1660 SDslu, 91 SDs, 0 SdLazy, 4943 SolverSat, 668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=5, 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 570 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 61 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1255 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 432 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 448052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 204/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...