./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Ackermann04_true-unreach-call_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/Ackermann04_true-unreach-call_true-no-overflow.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 307542ef0214b83df72c59e51df6e57e6557ac8b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:49:40,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:49:40,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:49:40,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:49:40,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:49:40,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:49:40,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:49:40,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:49:40,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:49:40,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:49:40,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:49:40,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:49:40,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:49:40,238 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:49:40,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:49:40,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:49:40,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:49:40,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:49:40,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:49:40,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:49:40,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:49:40,250 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:49:40,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:49:40,254 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:49:40,254 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:49:40,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:49:40,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:49:40,257 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:49:40,258 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:49:40,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:49:40,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:49:40,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:49:40,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:49:40,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:49:40,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:49:40,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:49:40,264 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:49:40,279 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:49:40,280 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:49:40,280 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:49:40,281 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:49:40,281 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:49:40,281 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:49:40,282 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:49:40,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:49:40,282 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:49:40,282 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:49:40,282 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:49:40,282 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:49:40,284 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:49:40,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:49:40,284 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:49:40,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:49:40,284 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:49:40,285 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:49:40,285 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:49:40,285 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:49:40,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:49:40,285 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:49:40,286 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:49:40,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:49:40,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:49:40,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:49:40,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:49:40,288 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:49:40,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:49:40,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:49:40,288 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 -> 307542ef0214b83df72c59e51df6e57e6557ac8b [2018-11-28 18:49:40,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:49:40,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:49:40,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:49:40,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:49:40,345 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:49:40,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Ackermann04_true-unreach-call_true-no-overflow.c [2018-11-28 18:49:40,413 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce359556/a052ca09d4fc48d4880bb5fc677977e0/FLAGd96f3293b [2018-11-28 18:49:40,889 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:49:40,891 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Ackermann04_true-unreach-call_true-no-overflow.c [2018-11-28 18:49:40,900 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce359556/a052ca09d4fc48d4880bb5fc677977e0/FLAGd96f3293b [2018-11-28 18:49:41,212 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce359556/a052ca09d4fc48d4880bb5fc677977e0 [2018-11-28 18:49:41,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:49:41,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:49:41,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:49:41,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:49:41,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:49:41,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd69d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41, skipping insertion in model container [2018-11-28 18:49:41,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:49:41,266 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:49:41,499 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:49:41,505 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:49:41,534 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:49:41,553 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:49:41,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41 WrapperNode [2018-11-28 18:49:41,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:49:41,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:49:41,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:49:41,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:49:41,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:49:41,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:49:41,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:49:41,581 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:49:41,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (1/1) ... [2018-11-28 18:49:41,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:49:41,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:49:41,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:49:41,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:49:41,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (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 [2018-11-28 18:49:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:49:41,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:49:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:49:41,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:49:41,739 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2018-11-28 18:49:41,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2018-11-28 18:49:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:49:41,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:49:41,972 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:49:41,972 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:49:41,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:41 BoogieIcfgContainer [2018-11-28 18:49:41,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:49:41,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:49:41,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:49:41,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:49:41,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:49:41" (1/3) ... [2018-11-28 18:49:41,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3199a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:49:41, skipping insertion in model container [2018-11-28 18:49:41,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:41" (2/3) ... [2018-11-28 18:49:41,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3199a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:49:41, skipping insertion in model container [2018-11-28 18:49:41,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:41" (3/3) ... [2018-11-28 18:49:41,982 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann04_true-unreach-call_true-no-overflow.c [2018-11-28 18:49:41,993 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:49:42,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:49:42,022 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:49:42,092 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:49:42,093 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:49:42,093 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:49:42,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:49:42,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:49:42,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:49:42,094 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:49:42,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:49:42,095 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:49:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-28 18:49:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:49:42,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:42,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:42,129 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:42,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1796234678, now seen corresponding path program 1 times [2018-11-28 18:49:42,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:42,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:42,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:49:42,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:42,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:49:42,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:49:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:49:42,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:49:42,450 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2018-11-28 18:49:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:42,747 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2018-11-28 18:49:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:49:42,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-28 18:49:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:42,762 INFO L225 Difference]: With dead ends: 55 [2018-11-28 18:49:42,763 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 18:49:42,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 18:49:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 18:49:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 18:49:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-28 18:49:42,818 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2018-11-28 18:49:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:42,818 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-28 18:49:42,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:49:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-11-28 18:49:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 18:49:42,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:42,822 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:42,822 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:42,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:42,823 INFO L82 PathProgramCache]: Analyzing trace with hash -895156504, now seen corresponding path program 1 times [2018-11-28 18:49:42,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:42,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:42,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:42,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:42,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:49:42,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:42,962 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 [2018-11-28 18:49:42,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:43,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:49:43,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:43,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 18:49:43,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:49:43,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:49:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:49:43,096 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2018-11-28 18:49:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:43,404 INFO L93 Difference]: Finished difference Result 52 states and 77 transitions. [2018-11-28 18:49:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:49:43,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-28 18:49:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:43,408 INFO L225 Difference]: With dead ends: 52 [2018-11-28 18:49:43,408 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 18:49:43,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 18:49:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 18:49:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:49:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-11-28 18:49:43,421 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2018-11-28 18:49:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:43,422 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-28 18:49:43,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:49:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2018-11-28 18:49:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 18:49:43,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:43,425 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-28 18:49:43,425 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:43,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash 718507263, now seen corresponding path program 1 times [2018-11-28 18:49:43,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:43,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:43,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:43,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:43,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 18:49:43,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:43,710 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 [2018-11-28 18:49:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:43,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 18:49:43,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:43,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-28 18:49:43,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:49:43,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:49:43,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:49:43,978 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 11 states. [2018-11-28 18:49:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:45,420 INFO L93 Difference]: Finished difference Result 87 states and 149 transitions. [2018-11-28 18:49:45,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 18:49:45,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-28 18:49:45,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:45,433 INFO L225 Difference]: With dead ends: 87 [2018-11-28 18:49:45,433 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 18:49:45,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:49:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 18:49:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-28 18:49:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 18:49:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-11-28 18:49:45,484 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 35 [2018-11-28 18:49:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:45,485 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-11-28 18:49:45,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:49:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-11-28 18:49:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-28 18:49:45,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:45,504 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:45,504 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:45,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2091057537, now seen corresponding path program 2 times [2018-11-28 18:49:45,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:45,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:45,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:45,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 95 proven. 322 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-28 18:49:45,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:45,843 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 [2018-11-28 18:49:45,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:49:45,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:49:45,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:45,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 360 proven. 86 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-28 18:49:46,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:46,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-28 18:49:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 18:49:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 18:49:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:49:46,337 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 22 states. [2018-11-28 18:49:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:48,334 INFO L93 Difference]: Finished difference Result 169 states and 415 transitions. [2018-11-28 18:49:48,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 18:49:48,335 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2018-11-28 18:49:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:48,342 INFO L225 Difference]: With dead ends: 169 [2018-11-28 18:49:48,342 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 18:49:48,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-11-28 18:49:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 18:49:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-11-28 18:49:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 18:49:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 146 transitions. [2018-11-28 18:49:48,369 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 146 transitions. Word has length 122 [2018-11-28 18:49:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:48,370 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 146 transitions. [2018-11-28 18:49:48,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 18:49:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 146 transitions. [2018-11-28 18:49:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-28 18:49:48,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:48,375 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:48,375 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:48,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2010206023, now seen corresponding path program 3 times [2018-11-28 18:49:48,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:48,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:48,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:48,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:48,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 103 proven. 171 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-28 18:49:48,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:48,761 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 [2018-11-28 18:49:48,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:49:48,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-28 18:49:48,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:48,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 190 proven. 71 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-28 18:49:48,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:48,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2018-11-28 18:49:48,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 18:49:48,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 18:49:48,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:49:48,903 INFO L87 Difference]: Start difference. First operand 82 states and 146 transitions. Second operand 13 states. [2018-11-28 18:49:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:49,422 INFO L93 Difference]: Finished difference Result 150 states and 285 transitions. [2018-11-28 18:49:49,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 18:49:49,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-11-28 18:49:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:49,429 INFO L225 Difference]: With dead ends: 150 [2018-11-28 18:49:49,430 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 18:49:49,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-11-28 18:49:49,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 18:49:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-11-28 18:49:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 18:49:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 138 transitions. [2018-11-28 18:49:49,452 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 138 transitions. Word has length 108 [2018-11-28 18:49:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:49,452 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 138 transitions. [2018-11-28 18:49:49,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 18:49:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 138 transitions. [2018-11-28 18:49:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-28 18:49:49,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:49,455 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:49,455 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:49,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1835077495, now seen corresponding path program 4 times [2018-11-28 18:49:49,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:49,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:49,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 139 proven. 297 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2018-11-28 18:49:49,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:49,710 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 [2018-11-28 18:49:49,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:49:49,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:49:49,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:49,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-28 18:49:49,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:49,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-28 18:49:49,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 18:49:49,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 18:49:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:49:49,893 INFO L87 Difference]: Start difference. First operand 82 states and 138 transitions. Second operand 14 states. [2018-11-28 18:49:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:50,638 INFO L93 Difference]: Finished difference Result 165 states and 311 transitions. [2018-11-28 18:49:50,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 18:49:50,645 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 134 [2018-11-28 18:49:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:50,652 INFO L225 Difference]: With dead ends: 165 [2018-11-28 18:49:50,652 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 18:49:50,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 18:49:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 18:49:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-11-28 18:49:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 18:49:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 170 transitions. [2018-11-28 18:49:50,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 170 transitions. Word has length 134 [2018-11-28 18:49:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:50,698 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 170 transitions. [2018-11-28 18:49:50,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 18:49:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 170 transitions. [2018-11-28 18:49:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-28 18:49:50,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:50,704 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:50,704 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:50,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1434361927, now seen corresponding path program 5 times [2018-11-28 18:49:50,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:50,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:50,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:50,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:50,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2018-11-28 18:49:51,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:51,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:51,231 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:49:51,379 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-28 18:49:51,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:51,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2018-11-28 18:49:51,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:51,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-28 18:49:51,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 18:49:51,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 18:49:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:49:51,483 INFO L87 Difference]: Start difference. First operand 97 states and 170 transitions. Second operand 20 states. [2018-11-28 18:49:52,296 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 18:49:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:52,799 INFO L93 Difference]: Finished difference Result 211 states and 413 transitions. [2018-11-28 18:49:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 18:49:52,801 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 160 [2018-11-28 18:49:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:52,805 INFO L225 Difference]: With dead ends: 211 [2018-11-28 18:49:52,805 INFO L226 Difference]: Without dead ends: 131 [2018-11-28 18:49:52,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=456, Invalid=2196, Unknown=0, NotChecked=0, Total=2652 [2018-11-28 18:49:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-28 18:49:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2018-11-28 18:49:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-28 18:49:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 221 transitions. [2018-11-28 18:49:52,834 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 221 transitions. Word has length 160 [2018-11-28 18:49:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:52,835 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 221 transitions. [2018-11-28 18:49:52,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 18:49:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 221 transitions. [2018-11-28 18:49:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-28 18:49:52,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:52,838 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:52,838 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:52,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash -66876812, now seen corresponding path program 6 times [2018-11-28 18:49:52,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:52,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:52,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:52,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:52,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2018-11-28 18:49:53,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:53,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:53,423 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:49:53,532 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-11-28 18:49:53,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:53,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2018-11-28 18:49:53,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:53,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-28 18:49:53,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 18:49:53,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 18:49:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-11-28 18:49:53,620 INFO L87 Difference]: Start difference. First operand 121 states and 221 transitions. Second operand 21 states. [2018-11-28 18:49:55,151 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 18:49:55,503 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-28 18:49:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:55,628 INFO L93 Difference]: Finished difference Result 250 states and 509 transitions. [2018-11-28 18:49:55,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-28 18:49:55,628 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 173 [2018-11-28 18:49:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:55,632 INFO L225 Difference]: With dead ends: 250 [2018-11-28 18:49:55,632 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 18:49:55,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=536, Invalid=2544, Unknown=0, NotChecked=0, Total=3080 [2018-11-28 18:49:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 18:49:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 136. [2018-11-28 18:49:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 18:49:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 257 transitions. [2018-11-28 18:49:55,670 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 257 transitions. Word has length 173 [2018-11-28 18:49:55,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:55,673 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 257 transitions. [2018-11-28 18:49:55,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 18:49:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 257 transitions. [2018-11-28 18:49:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-28 18:49:55,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:55,679 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:55,679 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:55,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1028004289, now seen corresponding path program 7 times [2018-11-28 18:49:55,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:55,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:55,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:55,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:55,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2018-11-28 18:49:56,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:56,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:49:56,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:56,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2018-11-28 18:49:56,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:56,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-28 18:49:56,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 18:49:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 18:49:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-11-28 18:49:56,387 INFO L87 Difference]: Start difference. First operand 136 states and 257 transitions. Second operand 23 states. [2018-11-28 18:49:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:56,997 INFO L93 Difference]: Finished difference Result 165 states and 304 transitions. [2018-11-28 18:49:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 18:49:57,004 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2018-11-28 18:49:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:57,008 INFO L225 Difference]: With dead ends: 165 [2018-11-28 18:49:57,008 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:49:57,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1667, Unknown=0, NotChecked=0, Total=1980 [2018-11-28 18:49:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:49:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:49:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:49:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:49:57,015 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2018-11-28 18:49:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:57,015 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:49:57,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 18:49:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:49:57,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:49:57,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:49:58,496 WARN L180 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 13 [2018-11-28 18:49:59,982 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 93 DAG size of output: 39 [2018-11-28 18:50:00,092 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:50:00,092 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:50:00,092 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:50:00,093 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:50:00,093 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:50:00,093 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:50:00,093 INFO L448 ceAbstractionStarter]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2018-11-28 18:50:00,093 INFO L451 ceAbstractionStarter]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2018-11-28 18:50:00,093 INFO L444 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (<= |ackermann_#in~n| ackermann_~n) (or (< |ackermann_#in~m| 0) (< 0 |ackermann_#in~m|))) [2018-11-28 18:50:00,093 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-11-28 18:50:00,093 INFO L444 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: (and (<= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (<= |ackermann_#in~n| ackermann_~n) (or (< |ackermann_#in~m| 0) (< 0 |ackermann_#in~m|))) [2018-11-28 18:50:00,094 INFO L444 ceAbstractionStarter]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse0 (<= 5 |ackermann_#t~ret1|)) (.cse1 (<= |ackermann_#in~n| 2)) (.cse3 (<= |ackermann_#in~n| 1)) (.cse2 (<= 6 |ackermann_#t~ret1|)) (.cse4 (<= |ackermann_#in~m| 1))) (and (< 0 |ackermann_#in~m|) (or (and .cse0 (<= |ackermann_#in~n| 4)) (and (<= 3 |ackermann_#t~ret1|) .cse1) .cse2 (and (<= 4 |ackermann_#t~ret1|) (<= |ackermann_#in~n| 3)) (and .cse3 .cse4 (<= 2 |ackermann_#t~ret1|))) (let ((.cse5 (= ackermann_~m |ackermann_#in~m|)) (.cse7 (= |ackermann_#in~m| ackermann_~m)) (.cse6 (<= |ackermann_#in~n| ackermann_~n))) (or (and .cse0 .cse5 .cse1 .cse6 (<= |ackermann_#in~m| 2)) (and .cse7 .cse6 .cse3) (and .cse5 .cse6 .cse2) (and .cse7 .cse6 .cse4))))) [2018-11-28 18:50:00,094 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 20) no Hoare annotation was computed. [2018-11-28 18:50:00,094 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-28 18:50:00,094 INFO L448 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2018-11-28 18:50:00,094 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-11-28 18:50:00,094 INFO L448 ceAbstractionStarter]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2018-11-28 18:50:00,094 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-28 18:50:00,094 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 25 45) the Hoare annotation is: true [2018-11-28 18:50:00,094 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2018-11-28 18:50:00,095 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2018-11-28 18:50:00,095 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 25 45) no Hoare annotation was computed. [2018-11-28 18:50:00,095 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 25 45) no Hoare annotation was computed. [2018-11-28 18:50:00,095 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-28 18:50:00,095 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 44) no Hoare annotation was computed. [2018-11-28 18:50:00,095 INFO L451 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: true [2018-11-28 18:50:00,095 INFO L448 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-11-28 18:50:00,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:50:00 BoogieIcfgContainer [2018-11-28 18:50:00,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:50:00,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:50:00,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:50:00,100 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:50:00,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:41" (3/4) ... [2018-11-28 18:50:00,105 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:50:00,111 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:50:00,111 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2018-11-28 18:50:00,111 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:50:00,116 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 18:50:00,117 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 18:50:00,117 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:50:00,169 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:50:00,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:50:00,170 INFO L168 Benchmark]: Toolchain (without parser) took 18953.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.0 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -250.8 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:00,172 INFO L168 Benchmark]: CDTParser took 0.19 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. [2018-11-28 18:50:00,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.01 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:00,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.33 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:50:00,173 INFO L168 Benchmark]: Boogie Preprocessor took 24.89 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:50:00,173 INFO L168 Benchmark]: RCFGBuilder took 367.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:00,176 INFO L168 Benchmark]: TraceAbstraction took 18124.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.2 MB). Peak memory consumption was 451.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:50:00,176 INFO L168 Benchmark]: Witness Printer took 69.20 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 18:50:00,181 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.19 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 331.01 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.33 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.89 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 367.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18124.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.2 MB). Peak memory consumption was 451.7 MB. Max. memory is 11.5 GB. * Witness Printer took 69.20 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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 4 procedures, 27 locations, 1 error locations. SAFE Result, 18.0s OverallTime, 9 OverallIterations, 27 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 233 SDtfs, 207 SDslu, 1237 SDs, 0 SdLazy, 2754 SolverSat, 622 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1289 GetRequests, 1004 SyntacticMatches, 2 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 461 PreInvPairs, 994 NumberOfFragments, 129 HoareAnnotationTreeSize, 461 FomulaSimplifications, 21378 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 9 FomulaSimplificationsInter, 5191 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1895 NumberOfCodeBlocks, 1838 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1878 ConstructedInterpolants, 0 QuantifiedInterpolants, 480474 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2592 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10454/13022 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...