./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/recHanoi02-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/recHanoi02-2.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d379c583eb269678169316efe01a55df7fa26acebe2991472725b0afcb2879ab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:13:57,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:13:57,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:13:57,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:13:57,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:13:57,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:13:57,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:13:57,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:13:57,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:13:57,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:13:57,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:13:57,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:13:57,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:13:57,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:13:57,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:13:57,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:13:57,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:13:57,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:13:57,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:13:57,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:13:57,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:13:57,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:13:57,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:13:57,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:13:57,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:13:57,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:13:57,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:13:57,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:13:57,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:13:57,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:13:57,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:13:57,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:13:57,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:13:57,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:13:57,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:13:57,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:13:57,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:13:57,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:13:57,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:13:57,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:13:57,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:13:57,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:13:57,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:13:57,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:13:57,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:13:57,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:13:57,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:13:57,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:13:57,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:13:57,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:13:57,452 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:13:57,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:13:57,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:13:57,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:13:57,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:13:57,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:13:57,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:13:57,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:13:57,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:13:57,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:13:57,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:13:57,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:13:57,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:13:57,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:13:57,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:13:57,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:13:57,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:57,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:13:57,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:13:57,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:13:57,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:13:57,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:13:57,457 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:13:57,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:13:57,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:13:57,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> d379c583eb269678169316efe01a55df7fa26acebe2991472725b0afcb2879ab [2022-02-20 18:13:57,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:13:57,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:13:57,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:13:57,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:13:57,687 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:13:57,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi02-2.c [2022-02-20 18:13:57,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825d937c5/7278cd0d55d74153bc56cc933b60e237/FLAGa9c3b37cc [2022-02-20 18:13:58,095 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:13:58,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi02-2.c [2022-02-20 18:13:58,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825d937c5/7278cd0d55d74153bc56cc933b60e237/FLAGa9c3b37cc [2022-02-20 18:13:58,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825d937c5/7278cd0d55d74153bc56cc933b60e237 [2022-02-20 18:13:58,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:13:58,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:13:58,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:58,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:13:58,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:13:58,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4ad5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58, skipping insertion in model container [2022-02-20 18:13:58,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:13:58,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:13:58,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi02-2.c[839,852] [2022-02-20 18:13:58,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:58,261 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:13:58,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi02-2.c[839,852] [2022-02-20 18:13:58,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:58,282 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:13:58,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58 WrapperNode [2022-02-20 18:13:58,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:58,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:58,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:13:58,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:13:58,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,307 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-20 18:13:58,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:58,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:13:58,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:13:58,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:13:58,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:13:58,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:13:58,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:13:58,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:13:58,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:58,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:13:58,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:13:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:13:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2022-02-20 18:13:58,375 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2022-02-20 18:13:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:13:58,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:13:58,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:13:58,419 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:13:58,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:13:58,540 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:13:58,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:13:58,562 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:13:58,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:58 BoogieIcfgContainer [2022-02-20 18:13:58,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:13:58,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:13:58,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:13:58,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:13:58,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:13:58" (1/3) ... [2022-02-20 18:13:58,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c935ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:58, skipping insertion in model container [2022-02-20 18:13:58,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58" (2/3) ... [2022-02-20 18:13:58,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c935ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:58, skipping insertion in model container [2022-02-20 18:13:58,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:58" (3/3) ... [2022-02-20 18:13:58,569 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi02-2.c [2022-02-20 18:13:58,573 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:13:58,573 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:13:58,610 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:13:58,617 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:13:58,617 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:13:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:13:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 18:13:58,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:58,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:58,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2022-02-20 18:13:58,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:58,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797595585] [2022-02-20 18:13:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:58,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:58,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} ~n := #in~n; {20#true} is VALID [2022-02-20 18:13:58,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume 1 == ~n;#res := 1; {28#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:58,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} assume true; {28#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:58,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} {20#true} #32#return; {26#(= |ULTIMATE.start_main_#t~ret6#1| 1)} is VALID [2022-02-20 18:13:58,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {20#true} is VALID [2022-02-20 18:13:58,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {20#true} is VALID [2022-02-20 18:13:58,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {20#true} is VALID [2022-02-20 18:13:58,885 INFO L272 TraceCheckUtils]: 3: Hoare triple {20#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {20#true} is VALID [2022-02-20 18:13:58,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#true} ~n := #in~n; {20#true} is VALID [2022-02-20 18:13:58,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#true} assume 1 == ~n;#res := 1; {28#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:58,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} assume true; {28#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:58,888 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} {20#true} #32#return; {26#(= |ULTIMATE.start_main_#t~ret6#1| 1)} is VALID [2022-02-20 18:13:58,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#(= |ULTIMATE.start_main_#t~ret6#1| 1)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {27#(= (+ (- 1) |ULTIMATE.start_main_~result~0#1|) 0)} is VALID [2022-02-20 18:13:58,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#(= (+ (- 1) |ULTIMATE.start_main_~result~0#1|) 0)} assume !(main_~result~0#1 >= 0); {21#false} is VALID [2022-02-20 18:13:58,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 18:13:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:13:58,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:58,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797595585] [2022-02-20 18:13:58,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797595585] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:58,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:13:58,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:13:58,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829836554] [2022-02-20 18:13:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 18:13:58,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:58,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:58,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:58,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:13:58,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:13:58,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:13:58,954 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:59,075 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 18:13:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:13:59,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 18:13:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-20 18:13:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-20 18:13:59,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-02-20 18:13:59,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:59,123 INFO L225 Difference]: With dead ends: 29 [2022-02-20 18:13:59,124 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 18:13:59,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:13:59,128 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:59,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 69 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:13:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 18:13:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 18:13:59,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:59,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:13:59,153 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:13:59,154 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:13:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:59,156 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 18:13:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 18:13:59,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:59,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:59,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states. [2022-02-20 18:13:59,158 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states. [2022-02-20 18:13:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:59,160 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 18:13:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 18:13:59,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:59,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:59,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:59,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:13:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-20 18:13:59,165 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-02-20 18:13:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:59,165 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-20 18:13:59,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 18:13:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 18:13:59,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:59,167 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:59,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:13:59,167 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2022-02-20 18:13:59,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:59,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767842473] [2022-02-20 18:13:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:59,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:13:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:59,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {117#true} ~n := #in~n; {117#true} is VALID [2022-02-20 18:13:59,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {117#true} assume 1 == ~n;#res := 1; {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:59,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} assume true; {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:59,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} {117#true} #30#return; {135#(= (+ (- 1) |hanoi_#t~ret4|) 0)} is VALID [2022-02-20 18:13:59,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {117#true} ~n := #in~n; {117#true} is VALID [2022-02-20 18:13:59,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {117#true} assume !(1 == ~n); {117#true} is VALID [2022-02-20 18:13:59,286 INFO L272 TraceCheckUtils]: 2: Hoare triple {117#true} call #t~ret4 := hanoi(~n - 1); {117#true} is VALID [2022-02-20 18:13:59,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {117#true} ~n := #in~n; {117#true} is VALID [2022-02-20 18:13:59,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {117#true} assume 1 == ~n;#res := 1; {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:59,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} assume true; {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:59,290 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} {117#true} #30#return; {135#(= (+ (- 1) |hanoi_#t~ret4|) 0)} is VALID [2022-02-20 18:13:59,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {135#(= (+ (- 1) |hanoi_#t~ret4|) 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {136#(<= 3 |hanoi_#res|)} is VALID [2022-02-20 18:13:59,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#(<= 3 |hanoi_#res|)} assume true; {136#(<= 3 |hanoi_#res|)} is VALID [2022-02-20 18:13:59,292 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {136#(<= 3 |hanoi_#res|)} {117#true} #32#return; {129#(<= 3 |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:13:59,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {117#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {117#true} is VALID [2022-02-20 18:13:59,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {117#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {117#true} is VALID [2022-02-20 18:13:59,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {117#true} is VALID [2022-02-20 18:13:59,293 INFO L272 TraceCheckUtils]: 3: Hoare triple {117#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {117#true} is VALID [2022-02-20 18:13:59,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {117#true} ~n := #in~n; {117#true} is VALID [2022-02-20 18:13:59,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#true} assume !(1 == ~n); {117#true} is VALID [2022-02-20 18:13:59,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {117#true} call #t~ret4 := hanoi(~n - 1); {117#true} is VALID [2022-02-20 18:13:59,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#true} ~n := #in~n; {117#true} is VALID [2022-02-20 18:13:59,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {117#true} assume 1 == ~n;#res := 1; {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:59,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} assume true; {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} is VALID [2022-02-20 18:13:59,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {137#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1))} {117#true} #30#return; {135#(= (+ (- 1) |hanoi_#t~ret4|) 0)} is VALID [2022-02-20 18:13:59,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#(= (+ (- 1) |hanoi_#t~ret4|) 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {136#(<= 3 |hanoi_#res|)} is VALID [2022-02-20 18:13:59,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {136#(<= 3 |hanoi_#res|)} assume true; {136#(<= 3 |hanoi_#res|)} is VALID [2022-02-20 18:13:59,298 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {136#(<= 3 |hanoi_#res|)} {117#true} #32#return; {129#(<= 3 |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:13:59,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {129#(<= 3 |ULTIMATE.start_main_#t~ret6#1|)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {130#(<= 3 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:59,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#(<= 3 |ULTIMATE.start_main_~result~0#1|)} assume !(main_~result~0#1 >= 0); {118#false} is VALID [2022-02-20 18:13:59,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {118#false} assume !false; {118#false} is VALID [2022-02-20 18:13:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:13:59,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:59,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767842473] [2022-02-20 18:13:59,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767842473] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:59,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612819556] [2022-02-20 18:13:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:59,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:59,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:59,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:13:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:59,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:13:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:59,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:59,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {117#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {117#true} is VALID [2022-02-20 18:13:59,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {117#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {117#true} is VALID [2022-02-20 18:13:59,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {117#true} is VALID [2022-02-20 18:13:59,509 INFO L272 TraceCheckUtils]: 3: Hoare triple {117#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {117#true} is VALID [2022-02-20 18:13:59,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {117#true} ~n := #in~n; {117#true} is VALID [2022-02-20 18:13:59,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#true} assume !(1 == ~n); {117#true} is VALID [2022-02-20 18:13:59,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {117#true} call #t~ret4 := hanoi(~n - 1); {117#true} is VALID [2022-02-20 18:13:59,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#true} ~n := #in~n; {117#true} is VALID [2022-02-20 18:13:59,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {117#true} assume 1 == ~n;#res := 1; {165#(<= 1 |hanoi_#res|)} is VALID [2022-02-20 18:13:59,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {165#(<= 1 |hanoi_#res|)} assume true; {165#(<= 1 |hanoi_#res|)} is VALID [2022-02-20 18:13:59,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {165#(<= 1 |hanoi_#res|)} {117#true} #30#return; {172#(<= 1 |hanoi_#t~ret4|)} is VALID [2022-02-20 18:13:59,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#(<= 1 |hanoi_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {136#(<= 3 |hanoi_#res|)} is VALID [2022-02-20 18:13:59,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {136#(<= 3 |hanoi_#res|)} assume true; {136#(<= 3 |hanoi_#res|)} is VALID [2022-02-20 18:13:59,513 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {136#(<= 3 |hanoi_#res|)} {117#true} #32#return; {129#(<= 3 |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:13:59,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {129#(<= 3 |ULTIMATE.start_main_#t~ret6#1|)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {130#(<= 3 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:59,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#(<= 3 |ULTIMATE.start_main_~result~0#1|)} assume !(main_~result~0#1 >= 0); {118#false} is VALID [2022-02-20 18:13:59,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {118#false} assume !false; {118#false} is VALID [2022-02-20 18:13:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:13:59,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:13:59,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612819556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:59,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 18:13:59,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2022-02-20 18:13:59,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944570241] [2022-02-20 18:13:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:59,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-02-20 18:13:59,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:59,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:59,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:59,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:13:59,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:13:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:13:59,530 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:59,582 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 18:13:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:13:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-02-20 18:13:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-02-20 18:13:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-02-20 18:13:59,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 17 transitions. [2022-02-20 18:13:59,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:59,598 INFO L225 Difference]: With dead ends: 16 [2022-02-20 18:13:59,598 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:13:59,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:13:59,599 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:59,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:13:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:13:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:13:59,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:59,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:59,601 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:59,601 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:59,601 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:13:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:59,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:59,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:59,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 18:13:59,602 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 18:13:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:59,602 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:13:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:59,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:59,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:59,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:59,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:13:59,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-02-20 18:13:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:59,603 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:13:59,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:59,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:59,606 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:13:59,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:59,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:59,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:13:59,828 INFO L858 garLoopResultBuilder]: For program point hanoiEXIT(lines 20 25) no Hoare annotation was computed. [2022-02-20 18:13:59,829 INFO L861 garLoopResultBuilder]: At program point hanoiENTRY(lines 20 25) the Hoare annotation is: true [2022-02-20 18:13:59,829 INFO L858 garLoopResultBuilder]: For program point hanoiFINAL(lines 20 25) no Hoare annotation was computed. [2022-02-20 18:13:59,829 INFO L861 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-02-20 18:13:59,829 INFO L858 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-02-20 18:13:59,829 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-02-20 18:13:59,829 INFO L861 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-02-20 18:13:59,829 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:13:59,830 INFO L858 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-02-20 18:13:59,830 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:13:59,830 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-02-20 18:13:59,830 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:13:59,830 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:13:59,830 INFO L861 garLoopResultBuilder]: At program point L28(lines 28 39) the Hoare annotation is: true [2022-02-20 18:13:59,830 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2022-02-20 18:13:59,830 INFO L858 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-02-20 18:13:59,831 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 38) no Hoare annotation was computed. [2022-02-20 18:13:59,833 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 18:13:59,834 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: hanoiFINAL has no Hoare annotation [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 18:13:59,837 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 18:13:59,838 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 18:13:59,839 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:13:59,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:13:59 BoogieIcfgContainer [2022-02-20 18:13:59,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:13:59,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:13:59,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:13:59,842 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:13:59,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:58" (3/4) ... [2022-02-20 18:13:59,845 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:13:59,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2022-02-20 18:13:59,851 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 18:13:59,851 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 18:13:59,851 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:13:59,851 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:13:59,869 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:13:59,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:13:59,870 INFO L158 Benchmark]: Toolchain (without parser) took 1758.56ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 56.5MB in the beginning and 79.9MB in the end (delta: -23.4MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2022-02-20 18:13:59,871 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 92.3MB. Free memory was 72.7MB in the beginning and 72.7MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:13:59,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.36ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 56.3MB in the beginning and 95.7MB in the end (delta: -39.4MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-02-20 18:13:59,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.03ms. Allocated memory is still 119.5MB. Free memory was 95.7MB in the beginning and 94.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:13:59,872 INFO L158 Benchmark]: Boogie Preprocessor took 16.16ms. Allocated memory is still 119.5MB. Free memory was 94.2MB in the beginning and 93.2MB in the end (delta: 982.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:13:59,872 INFO L158 Benchmark]: RCFGBuilder took 238.48ms. Allocated memory is still 119.5MB. Free memory was 93.2MB in the beginning and 83.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:13:59,872 INFO L158 Benchmark]: TraceAbstraction took 1277.17ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 968.8kB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-02-20 18:13:59,872 INFO L158 Benchmark]: Witness Printer took 27.55ms. Allocated memory is still 119.5MB. Free memory was 82.0MB in the beginning and 79.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:13:59,874 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 92.3MB. Free memory was 72.7MB in the beginning and 72.7MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.36ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 56.3MB in the beginning and 95.7MB in the end (delta: -39.4MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.03ms. Allocated memory is still 119.5MB. Free memory was 95.7MB in the beginning and 94.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.16ms. Allocated memory is still 119.5MB. Free memory was 94.2MB in the beginning and 93.2MB in the end (delta: 982.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 238.48ms. Allocated memory is still 119.5MB. Free memory was 93.2MB in the beginning and 83.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1277.17ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 968.8kB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Witness Printer took 27.55ms. Allocated memory is still 119.5MB. Free memory was 82.0MB in the beginning and 79.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 32 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 6 PreInvPairs, 8 NumberOfFragments, 4 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 62 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 18:13:59,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE