./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i --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/loops/sum04_true-unreach-call_true-termination.i -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 1dbb3ffac91b20f4dd3e7b4eb671e84b2870fc33 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:51:59,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:51:59,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:51:59,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:51:59,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:51:59,029 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:51:59,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:51:59,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:51:59,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:51:59,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:51:59,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:51:59,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:51:59,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:51:59,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:51:59,055 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:51:59,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:51:59,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:51:59,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:51:59,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:51:59,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:51:59,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:51:59,073 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:51:59,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:51:59,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:51:59,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:51:59,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:51:59,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:51:59,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:51:59,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:51:59,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:51:59,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:51:59,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:51:59,089 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:51:59,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:51:59,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:51:59,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:51:59,096 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:51:59,120 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:51:59,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:51:59,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:51:59,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:51:59,123 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:51:59,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:51:59,123 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:51:59,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:51:59,125 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:51:59,125 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:51:59,125 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:51:59,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:51:59,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:51:59,125 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:51:59,126 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:51:59,126 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:51:59,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:51:59,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:51:59,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:51:59,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:51:59,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:51:59,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:51:59,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:51:59,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:51:59,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:51:59,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:51:59,128 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:51:59,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:51:59,129 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 -> 1dbb3ffac91b20f4dd3e7b4eb671e84b2870fc33 [2019-01-12 10:51:59,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:51:59,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:51:59,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:51:59,206 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:51:59,206 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:51:59,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i [2019-01-12 10:51:59,276 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa643f8be/0886d7e487ba4094b7a4495efd97c746/FLAG8b997d730 [2019-01-12 10:51:59,662 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:51:59,662 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i [2019-01-12 10:51:59,668 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa643f8be/0886d7e487ba4094b7a4495efd97c746/FLAG8b997d730 [2019-01-12 10:52:00,051 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa643f8be/0886d7e487ba4094b7a4495efd97c746 [2019-01-12 10:52:00,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:52:00,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:52:00,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:52:00,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:52:00,063 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:52:00,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8b7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00, skipping insertion in model container [2019-01-12 10:52:00,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:52:00,093 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:52:00,324 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:52:00,335 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:52:00,353 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:52:00,372 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:52:00,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00 WrapperNode [2019-01-12 10:52:00,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:52:00,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:52:00,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:52:00,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:52:00,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:52:00,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:52:00,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:52:00,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:52:00,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (1/1) ... [2019-01-12 10:52:00,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:52:00,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:52:00,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:52:00,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:52:00,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (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 10:52:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:52:00,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:52:00,722 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:52:00,722 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 10:52:00,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:52:00 BoogieIcfgContainer [2019-01-12 10:52:00,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:52:00,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:52:00,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:52:00,728 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:52:00,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:52:00" (1/3) ... [2019-01-12 10:52:00,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ecda15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:52:00, skipping insertion in model container [2019-01-12 10:52:00,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:52:00" (2/3) ... [2019-01-12 10:52:00,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ecda15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:52:00, skipping insertion in model container [2019-01-12 10:52:00,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:52:00" (3/3) ... [2019-01-12 10:52:00,731 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_true-unreach-call_true-termination.i [2019-01-12 10:52:00,741 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:52:00,748 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:52:00,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:52:00,794 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:52:00,795 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:52:00,795 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:52:00,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:52:00,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:52:00,796 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:52:00,796 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:52:00,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:52:00,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:52:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-01-12 10:52:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 10:52:00,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:00,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 10:52:00,819 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:00,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:00,825 INFO L82 PathProgramCache]: Analyzing trace with hash 29776202, now seen corresponding path program 1 times [2019-01-12 10:52:00,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:00,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:00,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:00,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:52:00,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:00,943 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 10:52:00,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:52:00,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 10:52:00,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 10:52:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 10:52:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 10:52:00,962 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-01-12 10:52:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:01,036 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-01-12 10:52:01,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 10:52:01,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-12 10:52:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:01,047 INFO L225 Difference]: With dead ends: 19 [2019-01-12 10:52:01,047 INFO L226 Difference]: Without dead ends: 9 [2019-01-12 10:52:01,050 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 10:52:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-12 10:52:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-12 10:52:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-12 10:52:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-12 10:52:01,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-12 10:52:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:01,085 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-12 10:52:01,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 10:52:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-12 10:52:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 10:52:01,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:01,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:52:01,087 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1396608660, now seen corresponding path program 1 times [2019-01-12 10:52:01,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:01,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:01,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:52:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:01,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:52:01,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:52:01,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:52:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:01,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:52:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:01,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:52:01,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-12 10:52:01,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:52:01,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:52:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:52:01,286 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-01-12 10:52:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:01,328 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-12 10:52:01,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:52:01,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 10:52:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:01,329 INFO L225 Difference]: With dead ends: 15 [2019-01-12 10:52:01,330 INFO L226 Difference]: Without dead ends: 11 [2019-01-12 10:52:01,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:52:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-12 10:52:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-12 10:52:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-12 10:52:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-12 10:52:01,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-01-12 10:52:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:01,335 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-12 10:52:01,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:52:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-12 10:52:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 10:52:01,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:01,336 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-12 10:52:01,336 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2057893618, now seen corresponding path program 2 times [2019-01-12 10:52:01,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:01,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:01,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:01,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:52:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:01,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:52:01,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:52:01,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:52:01,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:52:01,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:52:01,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:52:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:52:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-12 10:52:01,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 10:52:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 10:52:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:52:01,481 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 5 states. [2019-01-12 10:52:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:01,542 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-12 10:52:01,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:52:01,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 10:52:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:01,543 INFO L225 Difference]: With dead ends: 17 [2019-01-12 10:52:01,543 INFO L226 Difference]: Without dead ends: 13 [2019-01-12 10:52:01,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:52:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-12 10:52:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-12 10:52:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 10:52:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-12 10:52:01,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-12 10:52:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:01,548 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-12 10:52:01,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 10:52:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-12 10:52:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 10:52:01,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:01,549 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2019-01-12 10:52:01,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1897578448, now seen corresponding path program 3 times [2019-01-12 10:52:01,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:01,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:01,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:01,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:52:01,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:01,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:52:01,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:52:01,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:52:01,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 10:52:01,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:52:01,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:52:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:01,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:52:01,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-12 10:52:01,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 10:52:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 10:52:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:52:01,838 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2019-01-12 10:52:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:01,970 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-12 10:52:01,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 10:52:01,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-12 10:52:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:01,972 INFO L225 Difference]: With dead ends: 19 [2019-01-12 10:52:01,972 INFO L226 Difference]: Without dead ends: 15 [2019-01-12 10:52:01,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:52:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-12 10:52:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-12 10:52:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 10:52:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-12 10:52:01,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-01-12 10:52:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:01,978 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-12 10:52:01,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 10:52:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-12 10:52:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 10:52:01,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:01,979 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2019-01-12 10:52:01,979 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1841444562, now seen corresponding path program 4 times [2019-01-12 10:52:01,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:01,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:52:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:02,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:52:02,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:52:02,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 10:52:02,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 10:52:02,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:52:02,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:52:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:02,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:52:02,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 10:52:02,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 10:52:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 10:52:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:52:02,201 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-01-12 10:52:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:02,259 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-12 10:52:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:52:02,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-12 10:52:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:02,261 INFO L225 Difference]: With dead ends: 21 [2019-01-12 10:52:02,261 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 10:52:02,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:52:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 10:52:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-12 10:52:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-12 10:52:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-12 10:52:02,267 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-01-12 10:52:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:02,267 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-12 10:52:02,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 10:52:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-12 10:52:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 10:52:02,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:02,269 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2019-01-12 10:52:02,269 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash 154930420, now seen corresponding path program 5 times [2019-01-12 10:52:02,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:02,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:02,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:02,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:52:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:02,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:52:02,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:52:02,431 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 10:52:02,496 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 10:52:02,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:52:02,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:52:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:02,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:52:02,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 10:52:02,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:52:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:52:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:52:02,527 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2019-01-12 10:52:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:02,583 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-12 10:52:02,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 10:52:02,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 10:52:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:02,585 INFO L225 Difference]: With dead ends: 23 [2019-01-12 10:52:02,585 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 10:52:02,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:52:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 10:52:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-12 10:52:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 10:52:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-12 10:52:02,591 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-01-12 10:52:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:02,591 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-12 10:52:02,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:52:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-12 10:52:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 10:52:02,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:02,593 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2019-01-12 10:52:02,593 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:02,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1382489450, now seen corresponding path program 6 times [2019-01-12 10:52:02,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:02,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:02,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:02,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:52:02,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:02,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:52:02,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:52:02,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 10:52:02,797 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 10:52:02,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:52:02,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:52:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:02,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:52:02,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 10:52:02,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 10:52:02,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 10:52:02,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-12 10:52:02,832 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 9 states. [2019-01-12 10:52:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:02,899 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-12 10:52:02,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 10:52:02,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-12 10:52:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:02,901 INFO L225 Difference]: With dead ends: 25 [2019-01-12 10:52:02,902 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 10:52:02,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-12 10:52:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 10:52:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-12 10:52:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 10:52:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-12 10:52:02,908 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-01-12 10:52:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:02,908 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-12 10:52:02,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 10:52:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-12 10:52:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 10:52:02,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:02,911 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2019-01-12 10:52:02,911 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:02,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1374234696, now seen corresponding path program 7 times [2019-01-12 10:52:02,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:02,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:02,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:52:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:03,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:52:03,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:52:03,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:52:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:03,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:52:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:03,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:52:03,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 10:52:03,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 10:52:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 10:52:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 10:52:03,391 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 10 states. [2019-01-12 10:52:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:03,437 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-12 10:52:03,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 10:52:03,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-01-12 10:52:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:03,443 INFO L225 Difference]: With dead ends: 26 [2019-01-12 10:52:03,443 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 10:52:03,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 10:52:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 10:52:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 10:52:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 10:52:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-12 10:52:03,448 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-01-12 10:52:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:03,448 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-12 10:52:03,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 10:52:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-12 10:52:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 10:52:03,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:03,453 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2019-01-12 10:52:03,454 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2031350694, now seen corresponding path program 8 times [2019-01-12 10:52:03,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:03,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:03,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:03,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:52:03,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:03,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:52:03,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:52:03,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:52:03,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:52:03,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:52:03,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:52:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:03,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:52:03,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 10:52:03,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 10:52:03,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 10:52:03,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-12 10:52:03,994 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-01-12 10:52:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:04,186 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-12 10:52:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 10:52:04,187 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-12 10:52:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:04,189 INFO L225 Difference]: With dead ends: 28 [2019-01-12 10:52:04,189 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 10:52:04,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-01-12 10:52:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 10:52:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-12 10:52:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 10:52:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-12 10:52:04,195 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-01-12 10:52:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:04,196 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-12 10:52:04,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 10:52:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-12 10:52:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 10:52:04,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:52:04,197 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2019-01-12 10:52:04,197 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:52:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:52:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2135335036, now seen corresponding path program 9 times [2019-01-12 10:52:04,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:52:04,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:52:04,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:04,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:52:04,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:52:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:52:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:52:04,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:52:04,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 10:52:04,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 10:52:04,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 10:52:04,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:52:04,431 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 11 states. [2019-01-12 10:52:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:52:04,494 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-12 10:52:04,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 10:52:04,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-12 10:52:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:52:04,496 INFO L225 Difference]: With dead ends: 24 [2019-01-12 10:52:04,496 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 10:52:04,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:52:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 10:52:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 10:52:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 10:52:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 10:52:04,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-01-12 10:52:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:52:04,498 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 10:52:04,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 10:52:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 10:52:04,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 10:52:04,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 10:52:04,649 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-12 10:52:04,671 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 10:52:04,671 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-01-12 10:52:04,672 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~sn~0 6) (<= 6 ULTIMATE.start_main_~sn~0) (<= 4 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 4)) (and (<= 9 ULTIMATE.start_main_~i~0) (<= 16 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 16)) (and (<= ULTIMATE.start_main_~sn~0 10) (<= ULTIMATE.start_main_~i~0 6) (<= 6 ULTIMATE.start_main_~i~0) (<= 10 ULTIMATE.start_main_~sn~0)) (and (<= ULTIMATE.start_main_~sn~0 12) (<= 7 ULTIMATE.start_main_~i~0) (<= 12 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~i~0 7)) (and (<= 8 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~i~0 5) (<= 5 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~sn~0 8)) (and (<= 2 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~i~0 2) (<= ULTIMATE.start_main_~sn~0 2) (<= 2 ULTIMATE.start_main_~i~0)) (and (<= ULTIMATE.start_main_~sn~0 0) (<= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 1) (<= 0 ULTIMATE.start_main_~sn~0)) (and (<= 3 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 3) (<= ULTIMATE.start_main_~sn~0 4) (<= 4 ULTIMATE.start_main_~sn~0)) (and (<= 14 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~i~0 8) (<= ULTIMATE.start_main_~sn~0 14) (<= 8 ULTIMATE.start_main_~i~0))) [2019-01-12 10:52:04,672 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2019-01-12 10:52:04,672 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 10:52:04,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 10:52:04,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 10:52:04,673 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 10:52:04,673 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 10:52:04,673 INFO L451 ceAbstractionStarter]: At program point L4-2(lines 1 17) the Hoare annotation is: true [2019-01-12 10:52:04,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:52:04 BoogieIcfgContainer [2019-01-12 10:52:04,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:52:04,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:52:04,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:52:04,695 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:52:04,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:52:00" (3/4) ... [2019-01-12 10:52:04,699 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 10:52:04,710 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 10:52:04,710 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 10:52:04,755 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:52:04,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:52:04,756 INFO L168 Benchmark]: Toolchain (without parser) took 4699.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 947.3 MB in the beginning and 910.7 MB in the end (delta: 36.6 MB). Peak memory consumption was 185.5 MB. Max. memory is 11.5 GB. [2019-01-12 10:52:04,757 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:52:04,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.61 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:52:04,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.62 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:52:04,759 INFO L168 Benchmark]: Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:52:04,759 INFO L168 Benchmark]: RCFGBuilder took 300.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-12 10:52:04,763 INFO L168 Benchmark]: TraceAbstraction took 3969.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.7 MB in the end (delta: 223.5 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. [2019-01-12 10:52:04,764 INFO L168 Benchmark]: Witness Printer took 60.83 ms. Allocated memory is still 1.2 GB. Free memory is still 910.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:52:04,769 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.61 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.62 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 300.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3969.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.7 MB in the end (delta: 223.5 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. * Witness Printer took 60.83 ms. Allocated memory is still 1.2 GB. Free memory is still 910.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 13]: Loop Invariant Derived loop invariant: ((((((((((sn <= 6 && 6 <= sn) && 4 <= i) && i <= 4) || ((9 <= i && 16 <= sn) && sn <= 16)) || (((sn <= 10 && i <= 6) && 6 <= i) && 10 <= sn)) || (((sn <= 12 && 7 <= i) && 12 <= sn) && i <= 7)) || (((8 <= sn && i <= 5) && 5 <= i) && sn <= 8)) || (((2 <= sn && i <= 2) && sn <= 2) && 2 <= i)) || (((sn <= 0 && 1 <= i) && i <= 1) && 0 <= sn)) || (((3 <= i && i <= 3) && sn <= 4) && 4 <= sn)) || (((14 <= sn && i <= 8) && sn <= 14) && 8 <= i) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 37 SDslu, 207 SDs, 0 SdLazy, 278 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=9, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 12 NumberOfFragments, 116 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 252 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 12168 SizeOfPredicates, 9 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 81/489 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...