./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id2_i5_o5_true-unreach-call_true-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/recursive-simple/id2_i5_o5_true-unreach-call_true-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 9448a6696b4991e038dda55623feb6ffc9366da0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:11:54,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:11:54,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:11:54,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:11:54,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:11:54,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:11:54,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:11:54,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:11:54,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:11:54,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:11:54,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:11:54,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:11:54,813 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:11:54,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:11:54,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:11:54,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:11:54,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:11:54,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:11:54,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:11:54,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:11:54,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:11:54,832 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:11:54,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:11:54,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:11:54,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:11:54,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:11:54,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:11:54,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:11:54,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:11:54,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:11:54,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:11:54,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:11:54,840 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:11:54,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:11:54,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:11:54,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:11:54,842 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:11:54,858 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:11:54,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:11:54,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:11:54,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:11:54,860 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:11:54,860 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:11:54,860 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:11:54,861 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:11:54,861 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:11:54,861 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:11:54,861 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:11:54,861 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:11:54,861 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:11:54,862 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:11:54,862 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:11:54,862 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:11:54,862 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:11:54,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:11:54,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:11:54,863 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:11:54,863 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:11:54,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:11:54,863 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:11:54,863 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:11:54,864 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:11:54,864 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:11:54,864 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:11:54,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:11:54,864 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 -> 9448a6696b4991e038dda55623feb6ffc9366da0 [2019-01-12 15:11:54,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:11:54,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:11:54,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:11:54,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:11:54,943 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:11:54,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id2_i5_o5_true-unreach-call_true-termination.c [2019-01-12 15:11:55,014 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb13b457/f462efb2df4745159c153107dc3d8e10/FLAG9834ff49a [2019-01-12 15:11:55,505 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:11:55,506 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id2_i5_o5_true-unreach-call_true-termination.c [2019-01-12 15:11:55,512 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb13b457/f462efb2df4745159c153107dc3d8e10/FLAG9834ff49a [2019-01-12 15:11:55,856 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb13b457/f462efb2df4745159c153107dc3d8e10 [2019-01-12 15:11:55,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:11:55,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:11:55,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:55,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:11:55,867 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:11:55,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:55" (1/1) ... [2019-01-12 15:11:55,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167de67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:55, skipping insertion in model container [2019-01-12 15:11:55,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:55" (1/1) ... [2019-01-12 15:11:55,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:11:55,896 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:11:56,116 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:56,121 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:11:56,139 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:56,159 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:11:56,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56 WrapperNode [2019-01-12 15:11:56,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:56,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:56,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:11:56,163 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:11:56,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:56,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:11:56,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:11:56,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:11:56,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (1/1) ... [2019-01-12 15:11:56,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:11:56,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:11:56,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:11:56,240 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:11:56,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (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 15:11:56,389 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2019-01-12 15:11:56,389 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2019-01-12 15:11:56,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:11:56,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:11:56,389 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 15:11:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 15:11:56,671 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:11:56,671 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:11:56,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:56 BoogieIcfgContainer [2019-01-12 15:11:56,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:11:56,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:11:56,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:11:56,692 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:11:56,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:11:55" (1/3) ... [2019-01-12 15:11:56,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f39740a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:56, skipping insertion in model container [2019-01-12 15:11:56,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:56" (2/3) ... [2019-01-12 15:11:56,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f39740a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:56, skipping insertion in model container [2019-01-12 15:11:56,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:56" (3/3) ... [2019-01-12 15:11:56,699 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5_true-unreach-call_true-termination.c [2019-01-12 15:11:56,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:11:56,740 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:11:56,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:11:56,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:11:56,802 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:11:56,802 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:11:56,803 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:11:56,803 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:11:56,803 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:11:56,803 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:11:56,803 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:11:56,803 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:11:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-12 15:11:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:11:56,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:56,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:56,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2105267373, now seen corresponding path program 1 times [2019-01-12 15:11:56,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:56,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:56,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:56,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:57,052 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 15:11:57,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:57,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:57,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:57,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:57,073 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-01-12 15:11:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:57,201 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-01-12 15:11:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:57,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:11:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:57,214 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:11:57,215 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:11:57,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:11:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:11:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:11:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:11:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-12 15:11:57,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2019-01-12 15:11:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:57,257 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-12 15:11:57,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-01-12 15:11:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:11:57,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:57,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:57,259 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:57,260 INFO L82 PathProgramCache]: Analyzing trace with hash -131148366, now seen corresponding path program 1 times [2019-01-12 15:11:57,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:57,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:57,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:57,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:57,369 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 15:11:57,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:57,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 15:11:57,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:11:57,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:11:57,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:11:57,373 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 7 states. [2019-01-12 15:11:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:57,747 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-01-12 15:11:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:11:57,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-12 15:11:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:57,749 INFO L225 Difference]: With dead ends: 29 [2019-01-12 15:11:57,750 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 15:11:57,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:11:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 15:11:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-12 15:11:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:11:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-01-12 15:11:57,757 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-01-12 15:11:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:57,758 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-01-12 15:11:57,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:11:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-01-12 15:11:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:11:57,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:57,759 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:57,760 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash -132605643, now seen corresponding path program 1 times [2019-01-12 15:11:57,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:57,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:57,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:57,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:11:57,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:57,974 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 15:11:57,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:58,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:11:58,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:58,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 15:11:58,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:58,103 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-01-12 15:11:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:58,349 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-01-12 15:11:58,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:58,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-01-12 15:11:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:58,356 INFO L225 Difference]: With dead ends: 35 [2019-01-12 15:11:58,357 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 15:11:58,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:11:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 15:11:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-01-12 15:11:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:11:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-12 15:11:58,365 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2019-01-12 15:11:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:58,365 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-12 15:11:58,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-12 15:11:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:11:58,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:58,367 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:58,367 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash -614490246, now seen corresponding path program 1 times [2019-01-12 15:11:58,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:58,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:58,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:58,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:58,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:58,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:58,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:58,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:11:58,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:11:58,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:11:58,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:11:58,718 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2019-01-12 15:11:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:59,157 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-12 15:11:59,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:11:59,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-01-12 15:11:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:59,160 INFO L225 Difference]: With dead ends: 41 [2019-01-12 15:11:59,160 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 15:11:59,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:11:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 15:11:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-01-12 15:11:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:11:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-12 15:11:59,168 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2019-01-12 15:11:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:59,169 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-12 15:11:59,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:11:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-01-12 15:11:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:11:59,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:59,171 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:59,171 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:59,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:59,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2127867459, now seen corresponding path program 2 times [2019-01-12 15:11:59,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:59,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:59,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 15:11:59,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:59,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:59,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:59,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:59,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:59,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 15:11:59,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:59,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:11:59,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:11:59,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:11:59,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:11:59,420 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 10 states. [2019-01-12 15:11:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:59,694 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-01-12 15:11:59,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:11:59,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-01-12 15:11:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:59,696 INFO L225 Difference]: With dead ends: 47 [2019-01-12 15:11:59,696 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 15:11:59,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:11:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 15:11:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-01-12 15:11:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:11:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-01-12 15:11:59,704 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 33 [2019-01-12 15:11:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:59,704 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-01-12 15:11:59,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:11:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-01-12 15:11:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:11:59,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:59,706 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:59,706 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:59,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1002836670, now seen corresponding path program 2 times [2019-01-12 15:11:59,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:59,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:59,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:59,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:59,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 15:12:00,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:00,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:00,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:00,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:00,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:00,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 15:12:00,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:00,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 15:12:00,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:12:00,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:12:00,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:12:00,297 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2019-01-12 15:12:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:00,457 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-01-12 15:12:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:12:00,458 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-01-12 15:12:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:00,461 INFO L225 Difference]: With dead ends: 53 [2019-01-12 15:12:00,461 INFO L226 Difference]: Without dead ends: 49 [2019-01-12 15:12:00,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:12:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-12 15:12:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-01-12 15:12:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:12:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-12 15:12:00,470 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 39 [2019-01-12 15:12:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:00,471 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-12 15:12:00,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:12:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-12 15:12:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:12:00,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:00,472 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:00,473 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:00,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:00,473 INFO L82 PathProgramCache]: Analyzing trace with hash 688258629, now seen corresponding path program 3 times [2019-01-12 15:12:00,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:00,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:00,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:00,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:00,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-12 15:12:00,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:00,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 15:12:00,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:12:00,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:12:00,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:00,778 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2019-01-12 15:12:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:01,031 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-01-12 15:12:01,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:12:01,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-12 15:12:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:01,034 INFO L225 Difference]: With dead ends: 59 [2019-01-12 15:12:01,034 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:12:01,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:12:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:12:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:12:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:12:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:12:01,044 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 45 [2019-01-12 15:12:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:01,045 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:12:01,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:12:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:12:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:12:01,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:01,048 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:01,049 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:01,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:01,049 INFO L82 PathProgramCache]: Analyzing trace with hash -77349110, now seen corresponding path program 3 times [2019-01-12 15:12:01,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:01,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 15:12:01,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:01,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:01,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:01,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:12:01,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:01,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-12 15:12:01,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 15:12:01,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2019-01-12 15:12:01,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 15:12:01,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 15:12:01,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:01,842 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 24 states. [2019-01-12 15:12:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:03,164 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2019-01-12 15:12:03,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 15:12:03,165 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2019-01-12 15:12:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:03,166 INFO L225 Difference]: With dead ends: 64 [2019-01-12 15:12:03,166 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:12:03,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:12:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:12:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:12:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:12:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:12:03,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-01-12 15:12:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:03,170 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:12:03,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 15:12:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:12:03,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:12:03,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:12:03,291 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (<= |id2_#in~x| id2_~x) (<= id2_~x |id2_#in~x|) (not (= id2_~x 0))) [2019-01-12 15:12:03,291 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-01-12 15:12:03,291 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-12 15:12:03,291 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 12 15) no Hoare annotation was computed. [2019-01-12 15:12:03,291 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 12 15) the Hoare annotation is: true [2019-01-12 15:12:03,291 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 12 15) no Hoare annotation was computed. [2019-01-12 15:12:03,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:12:03,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:12:03,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:12:03,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2019-01-12 15:12:03,292 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-12 15:12:03,292 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2019-01-12 15:12:03,293 INFO L444 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: (and (<= 5 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 5)) [2019-01-12 15:12:03,293 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-01-12 15:12:03,293 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 23) no Hoare annotation was computed. [2019-01-12 15:12:03,293 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 10) no Hoare annotation was computed. [2019-01-12 15:12:03,293 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 10) no Hoare annotation was computed. [2019-01-12 15:12:03,293 INFO L444 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: (and (<= |id_#in~x| id_~x) (<= id_~x |id_#in~x|)) [2019-01-12 15:12:03,294 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2019-01-12 15:12:03,295 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-01-12 15:12:03,295 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 10) the Hoare annotation is: true [2019-01-12 15:12:03,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:12:03 BoogieIcfgContainer [2019-01-12 15:12:03,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:12:03,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:12:03,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:12:03,300 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:12:03,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:56" (3/4) ... [2019-01-12 15:12:03,303 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:12:03,309 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2019-01-12 15:12:03,310 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-01-12 15:12:03,314 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:12:03,315 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:12:03,356 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:12:03,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:12:03,357 INFO L168 Benchmark]: Toolchain (without parser) took 7496.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 67.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:03,359 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:03,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.98 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 937.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:03,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.00 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:03,360 INFO L168 Benchmark]: Boogie Preprocessor took 29.58 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:03,360 INFO L168 Benchmark]: RCFGBuilder took 441.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:03,361 INFO L168 Benchmark]: TraceAbstraction took 6612.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:03,362 INFO L168 Benchmark]: Witness Printer took 57.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:03,365 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.98 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 937.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.00 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.58 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 441.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6612.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. * Witness Printer took 57.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. SAFE Result, 6.5s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 144 SDtfs, 134 SDslu, 914 SDs, 0 SdLazy, 779 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 19 PreInvPairs, 19 NumberOfFragments, 27 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 47124 SizeOfPredicates, 25 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 215/312 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...