./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29670da151301b8436a6c7ddafad57f5257b4a8d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:52:28,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:52:28,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:52:28,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:52:28,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:52:28,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:52:28,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:52:28,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:52:28,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:52:28,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:52:28,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:52:28,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:52:28,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:52:28,787 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:52:28,794 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:52:28,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:52:28,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:52:28,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:52:28,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:52:28,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:52:28,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:52:28,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:52:28,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:52:28,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:52:28,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:52:28,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:52:28,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:52:28,823 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:52:28,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:52:28,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:52:28,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:52:28,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:52:28,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:52:28,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:52:28,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:52:28,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:52:28,834 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:52:28,852 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:52:28,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:52:28,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:52:28,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:52:28,854 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:52:28,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:52:28,855 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:52:28,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:52:28,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:52:28,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:52:28,855 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:52:28,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:52:28,856 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:52:28,856 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:52:28,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:52:28,856 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:52:28,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:52:28,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:52:28,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:52:28,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:52:28,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:52:28,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:52:28,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:52:28,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:52:28,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:52:28,858 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:52:28,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:52:28,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:52:28,858 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 -> 29670da151301b8436a6c7ddafad57f5257b4a8d [2019-01-12 00:52:28,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:52:28,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:52:28,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:52:28,934 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:52:28,934 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:52:28,935 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2019-01-12 00:52:28,999 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b3868b6/e58b5b52c41c42f0b3e1e750152bdab7/FLAGb3899d649 [2019-01-12 00:52:29,596 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:52:29,597 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2019-01-12 00:52:29,612 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b3868b6/e58b5b52c41c42f0b3e1e750152bdab7/FLAGb3899d649 [2019-01-12 00:52:29,792 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b3868b6/e58b5b52c41c42f0b3e1e750152bdab7 [2019-01-12 00:52:29,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:52:29,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:52:29,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:52:29,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:52:29,806 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:52:29,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:52:29" (1/1) ... [2019-01-12 00:52:29,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104d3319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:29, skipping insertion in model container [2019-01-12 00:52:29,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:52:29" (1/1) ... [2019-01-12 00:52:29,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:52:29,877 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:52:30,388 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:52:30,394 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:52:30,536 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:52:30,558 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:52:30,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30 WrapperNode [2019-01-12 00:52:30,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:52:30,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:52:30,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:52:30,560 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:52:30,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:52:30,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:52:30,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:52:30,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:52:30,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... [2019-01-12 00:52:30,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:52:30,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:52:30,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:52:30,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:52:30,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:52:30,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:52:30,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:52:34,038 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:52:34,039 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:52:34,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:34 BoogieIcfgContainer [2019-01-12 00:52:34,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:52:34,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:52:34,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:52:34,045 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:52:34,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:52:29" (1/3) ... [2019-01-12 00:52:34,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4000fb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:52:34, skipping insertion in model container [2019-01-12 00:52:34,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:30" (2/3) ... [2019-01-12 00:52:34,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4000fb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:52:34, skipping insertion in model container [2019-01-12 00:52:34,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:34" (3/3) ... [2019-01-12 00:52:34,048 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label25_true-unreach-call_false-termination.c [2019-01-12 00:52:34,059 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:52:34,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:52:34,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:52:34,134 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:52:34,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:52:34,136 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:52:34,136 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:52:34,137 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:52:34,137 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:52:34,139 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:52:34,139 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:52:34,139 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:52:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:52:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 00:52:34,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:34,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:34,208 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash -278930290, now seen corresponding path program 1 times [2019-01-12 00:52:34,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:34,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:34,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:34,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:34,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:34,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:34,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:34,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:34,908 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:52:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:37,469 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:52:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:52:37,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-01-12 00:52:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:37,491 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:52:37,492 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:52:37,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:52:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-01-12 00:52:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-12 00:52:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-01-12 00:52:37,579 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 119 [2019-01-12 00:52:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:37,580 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-01-12 00:52:37,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-01-12 00:52:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-12 00:52:37,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:37,587 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:37,588 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:37,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:37,588 INFO L82 PathProgramCache]: Analyzing trace with hash -451650634, now seen corresponding path program 1 times [2019-01-12 00:52:37,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:37,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:37,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:37,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:37,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:37,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:37,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:37,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:37,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:37,742 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-01-12 00:52:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:38,851 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-01-12 00:52:38,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:38,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-01-12 00:52:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:38,858 INFO L225 Difference]: With dead ends: 1185 [2019-01-12 00:52:38,859 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:52:38,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:52:38,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:52:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:52:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-01-12 00:52:38,906 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 124 [2019-01-12 00:52:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:38,906 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-01-12 00:52:38,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:38,907 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-01-12 00:52:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-12 00:52:38,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:38,913 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:38,913 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash 329866697, now seen corresponding path program 1 times [2019-01-12 00:52:38,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:38,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 00:52:39,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:39,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:39,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:39,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:39,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:39,030 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-01-12 00:52:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:40,102 INFO L93 Difference]: Finished difference Result 1971 states and 2688 transitions. [2019-01-12 00:52:40,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:40,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-01-12 00:52:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:40,110 INFO L225 Difference]: With dead ends: 1971 [2019-01-12 00:52:40,110 INFO L226 Difference]: Without dead ends: 1183 [2019-01-12 00:52:40,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-01-12 00:52:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 790. [2019-01-12 00:52:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:52:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-01-12 00:52:40,139 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 131 [2019-01-12 00:52:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:40,139 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-01-12 00:52:40,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-01-12 00:52:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-12 00:52:40,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:40,146 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:40,146 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:40,146 INFO L82 PathProgramCache]: Analyzing trace with hash 935317039, now seen corresponding path program 1 times [2019-01-12 00:52:40,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:40,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:40,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:40,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:40,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:40,419 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:52:40,665 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:52:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:40,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:40,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:40,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:40,696 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 4 states. [2019-01-12 00:52:40,995 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-12 00:52:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:42,370 INFO L93 Difference]: Finished difference Result 1714 states and 2292 transitions. [2019-01-12 00:52:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:52:42,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-01-12 00:52:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:42,377 INFO L225 Difference]: With dead ends: 1714 [2019-01-12 00:52:42,377 INFO L226 Difference]: Without dead ends: 926 [2019-01-12 00:52:42,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:52:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-01-12 00:52:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 921. [2019-01-12 00:52:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-01-12 00:52:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1204 transitions. [2019-01-12 00:52:42,431 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1204 transitions. Word has length 134 [2019-01-12 00:52:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:42,432 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1204 transitions. [2019-01-12 00:52:42,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1204 transitions. [2019-01-12 00:52:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-12 00:52:42,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:42,437 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:42,437 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1288510055, now seen corresponding path program 1 times [2019-01-12 00:52:42,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:42,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:42,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:42,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:42,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:42,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:52:42,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:52:42,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:52:42,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:52:42,690 INFO L87 Difference]: Start difference. First operand 921 states and 1204 transitions. Second operand 5 states. [2019-01-12 00:52:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:43,943 INFO L93 Difference]: Finished difference Result 2233 states and 2968 transitions. [2019-01-12 00:52:43,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:52:43,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-01-12 00:52:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:43,952 INFO L225 Difference]: With dead ends: 2233 [2019-01-12 00:52:43,952 INFO L226 Difference]: Without dead ends: 1445 [2019-01-12 00:52:43,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:52:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-12 00:52:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-01-12 00:52:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:52:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1807 transitions. [2019-01-12 00:52:43,987 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1807 transitions. Word has length 138 [2019-01-12 00:52:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:43,987 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1807 transitions. [2019-01-12 00:52:43,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:52:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1807 transitions. [2019-01-12 00:52:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 00:52:43,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:43,992 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:43,993 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash -965503870, now seen corresponding path program 1 times [2019-01-12 00:52:43,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:43,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:43,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:44,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:44,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:44,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:44,101 INFO L87 Difference]: Start difference. First operand 1445 states and 1807 transitions. Second operand 3 states. [2019-01-12 00:52:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:44,730 INFO L93 Difference]: Finished difference Result 3150 states and 3958 transitions. [2019-01-12 00:52:44,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:44,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-01-12 00:52:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:44,741 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:52:44,741 INFO L226 Difference]: Without dead ends: 1707 [2019-01-12 00:52:44,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-12 00:52:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-01-12 00:52:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:52:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1666 transitions. [2019-01-12 00:52:44,777 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1666 transitions. Word has length 141 [2019-01-12 00:52:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:44,777 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1666 transitions. [2019-01-12 00:52:44,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1666 transitions. [2019-01-12 00:52:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 00:52:44,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:44,783 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:44,783 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:44,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash -750696464, now seen corresponding path program 1 times [2019-01-12 00:52:44,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:44,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:44,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-12 00:52:44,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:44,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:44,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:44,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:44,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:44,912 INFO L87 Difference]: Start difference. First operand 1445 states and 1666 transitions. Second operand 3 states. [2019-01-12 00:52:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:45,419 INFO L93 Difference]: Finished difference Result 2888 states and 3328 transitions. [2019-01-12 00:52:45,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:45,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-01-12 00:52:45,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:45,429 INFO L225 Difference]: With dead ends: 2888 [2019-01-12 00:52:45,429 INFO L226 Difference]: Without dead ends: 1445 [2019-01-12 00:52:45,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-12 00:52:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-01-12 00:52:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:52:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1594 transitions. [2019-01-12 00:52:45,469 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1594 transitions. Word has length 149 [2019-01-12 00:52:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:45,469 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1594 transitions. [2019-01-12 00:52:45,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1594 transitions. [2019-01-12 00:52:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 00:52:45,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:45,476 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:52:45,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:45,476 INFO L82 PathProgramCache]: Analyzing trace with hash 396028422, now seen corresponding path program 1 times [2019-01-12 00:52:45,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:45,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:45,851 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 00:52:46,088 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 00:52:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:46,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 00:52:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 00:52:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 00:52:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-12 00:52:46,702 INFO L87 Difference]: Start difference. First operand 1445 states and 1594 transitions. Second operand 12 states. [2019-01-12 00:52:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:49,793 INFO L93 Difference]: Finished difference Result 3260 states and 3655 transitions. [2019-01-12 00:52:49,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 00:52:49,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2019-01-12 00:52:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:49,802 INFO L225 Difference]: With dead ends: 3260 [2019-01-12 00:52:49,802 INFO L226 Difference]: Without dead ends: 1914 [2019-01-12 00:52:49,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-01-12 00:52:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-01-12 00:52:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2019-01-12 00:52:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-01-12 00:52:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1909 transitions. [2019-01-12 00:52:49,843 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1909 transitions. Word has length 156 [2019-01-12 00:52:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:49,843 INFO L480 AbstractCegarLoop]: Abstraction has 1742 states and 1909 transitions. [2019-01-12 00:52:49,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 00:52:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1909 transitions. [2019-01-12 00:52:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-12 00:52:49,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:49,851 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:52:49,851 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1825782608, now seen corresponding path program 1 times [2019-01-12 00:52:49,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:49,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:49,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:49,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:49,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-12 00:52:50,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:50,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:50,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:50,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:50,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:50,088 INFO L87 Difference]: Start difference. First operand 1742 states and 1909 transitions. Second operand 3 states. [2019-01-12 00:52:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:50,737 INFO L93 Difference]: Finished difference Result 1744 states and 1910 transitions. [2019-01-12 00:52:50,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:50,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-01-12 00:52:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:50,746 INFO L225 Difference]: With dead ends: 1744 [2019-01-12 00:52:50,746 INFO L226 Difference]: Without dead ends: 1742 [2019-01-12 00:52:50,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-01-12 00:52:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2019-01-12 00:52:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-01-12 00:52:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1907 transitions. [2019-01-12 00:52:50,779 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1907 transitions. Word has length 225 [2019-01-12 00:52:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:50,780 INFO L480 AbstractCegarLoop]: Abstraction has 1742 states and 1907 transitions. [2019-01-12 00:52:50,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1907 transitions. [2019-01-12 00:52:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-12 00:52:50,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:50,787 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:50,787 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:50,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:50,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1135581686, now seen corresponding path program 1 times [2019-01-12 00:52:50,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:50,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:50,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:50,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 00:52:51,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:52:51,112 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 00:52:51,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:51,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:52:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-01-12 00:52:51,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:52:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 00:52:51,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 00:52:51,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 00:52:51,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 00:52:51,520 INFO L87 Difference]: Start difference. First operand 1742 states and 1907 transitions. Second operand 7 states. [2019-01-12 00:52:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:54,109 INFO L93 Difference]: Finished difference Result 3358 states and 3686 transitions. [2019-01-12 00:52:54,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 00:52:54,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-01-12 00:52:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:54,111 INFO L225 Difference]: With dead ends: 3358 [2019-01-12 00:52:54,111 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:52:54,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:52:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:52:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:52:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:52:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:52:54,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-01-12 00:52:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:54,116 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:52:54,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 00:52:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:52:54,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:52:54,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:52:54,605 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-01-12 00:52:54,929 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:52:54,932 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,933 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:52:54,934 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:52:54,935 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:52:54,936 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:52:54,936 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:52:54,936 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:52:54,936 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:52:54,936 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:52:54,936 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:52:54,936 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (<= ~a21~0 0)) (.cse0 (= ~a7~0 1)) (.cse3 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and (not .cse0) .cse1) (and .cse0 .cse2 .cse3) (and .cse2 .cse0 (= ~a12~0 8) (= ~a20~0 1)) (and .cse1 (= ~a16~0 5)) (and (= ~a16~0 4) .cse1) (and .cse3 (= ~a17~0 1) .cse1))) [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:52:54,937 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:52:54,938 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:52:54,939 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:52:54,939 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:52:54,939 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:52:54,939 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:52:54,939 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:52:54,939 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:52:54,939 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:52:54,939 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:52:54,940 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:52:54,941 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:52:54,942 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:52:54,942 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:52:54,942 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:52:54,942 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:52:54,942 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:52:54,942 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:52:54,942 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2019-01-12 00:52:54,942 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:52:54,943 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:52:54,943 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:52:54,944 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:52:54,944 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:52:54,944 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,944 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a21~0 0)) (.cse0 (= ~a7~0 1)) (.cse3 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and (not .cse0) .cse1) (and .cse0 .cse2 .cse3) (and .cse2 .cse0 (= ~a12~0 8) (= ~a20~0 1)) (and .cse1 (= ~a16~0 5)) (and (= ~a16~0 4) .cse1) (and .cse3 (= ~a17~0 1) .cse1))) [2019-01-12 00:52:54,944 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,944 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:52:54,945 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:52:54,946 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:52:54,947 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:52:54,948 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:52:54,948 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:52:54,948 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:52:54,948 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:52:54,948 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:52:54,949 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:52:54,949 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:52:54,949 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:52:54,949 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,949 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,949 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,949 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,949 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:52:54,952 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,953 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,953 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:52:54,953 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:52:54,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:52:54,953 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:52:54,954 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:52:54,954 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:52:54,954 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:52:54,954 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:52:54,954 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:52:54,954 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:52:54,954 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:52:54,955 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:52:54,959 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:52:54,959 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,959 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,959 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,959 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,960 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,960 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:52:54,960 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,960 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:52:54,960 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:52:54,960 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:52:54,960 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:52:54,961 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:52:54,961 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:52:54,961 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:52:54,961 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:52:54,961 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:52:54,961 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:52:54,961 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:52:54,962 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:52:54,963 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:52:54,963 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:52:54,963 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:52:54,963 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,963 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,963 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,963 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:52:54,964 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:52:54,965 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:52:54,965 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:52:54,965 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:52:54,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:52:54 BoogieIcfgContainer [2019-01-12 00:52:54,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:52:54,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:52:54,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:52:54,993 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:52:54,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:34" (3/4) ... [2019-01-12 00:52:55,001 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:52:55,045 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:52:55,047 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:52:55,307 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:52:55,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:52:55,309 INFO L168 Benchmark]: Toolchain (without parser) took 25512.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 389.0 MB). Free memory was 947.3 MB in the beginning and 807.5 MB in the end (delta: 139.8 MB). Peak memory consumption was 528.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:52:55,310 INFO L168 Benchmark]: CDTParser took 0.18 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 00:52:55,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.45 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 913.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:52:55,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:52:55,312 INFO L168 Benchmark]: Boogie Preprocessor took 92.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:52:55,312 INFO L168 Benchmark]: RCFGBuilder took 3202.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:52:55,312 INFO L168 Benchmark]: TraceAbstraction took 20950.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.0 GB in the beginning and 819.1 MB in the end (delta: 190.9 MB). Peak memory consumption was 444.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:52:55,313 INFO L168 Benchmark]: Witness Printer took 315.11 ms. Allocated memory is still 1.4 GB. Free memory was 819.1 MB in the beginning and 807.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:52:55,317 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.18 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 760.45 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 913.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 184.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3202.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20950.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.0 GB in the beginning and 819.1 MB in the end (delta: 190.9 MB). Peak memory consumption was 444.6 MB. Max. memory is 11.5 GB. * Witness Printer took 315.11 ms. Allocated memory is still 1.4 GB. Free memory was 819.1 MB in the beginning and 807.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: 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: 30]: Loop Invariant Derived loop invariant: (((((!(a7 == 1) && a21 == 1) || ((a7 == 1 && a21 <= 0) && !(a16 == 6))) || (((a21 <= 0 && a7 == 1) && a12 == 8) && a20 == 1)) || (a21 == 1 && a16 == 5)) || (a16 == 4 && a21 == 1)) || ((!(a16 == 6) && a17 == 1) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((!(a7 == 1) && a21 == 1) || ((a7 == 1 && a21 <= 0) && !(a16 == 6))) || (((a21 <= 0 && a7 == 1) && a12 == 8) && a20 == 1)) || (a21 == 1 && a16 == 5)) || (a16 == 4 && a21 == 1)) || ((!(a16 == 6) && a17 == 1) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 20.8s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 578 SDtfs, 2366 SDslu, 140 SDs, 0 SdLazy, 6421 SolverSat, 743 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 251 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 832 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 117 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2147 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1797 NumberOfCodeBlocks, 1797 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1786 ConstructedInterpolants, 0 QuantifiedInterpolants, 1060078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 882/909 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...