./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/bitvector-regression/recHanoi03-1.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 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-14 22:33:07,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 22:33:07,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 22:33:07,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 22:33:07,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 22:33:07,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 22:33:07,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 22:33:07,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 22:33:07,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 22:33:07,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 22:33:07,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 22:33:07,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 22:33:07,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 22:33:07,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 22:33:07,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 22:33:07,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 22:33:07,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 22:33:07,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 22:33:07,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 22:33:07,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 22:33:07,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 22:33:07,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 22:33:07,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 22:33:07,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 22:33:07,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 22:33:07,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 22:33:07,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 22:33:07,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 22:33:07,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 22:33:07,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 22:33:07,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 22:33:07,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 22:33:07,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 22:33:07,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 22:33:07,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 22:33:07,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 22:33:07,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 22:33:07,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 22:33:07,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 22:33:07,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 22:33:07,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 22:33:07,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 22:33:07,443 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 22:33:07,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 22:33:07,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 22:33:07,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 22:33:07,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 22:33:07,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 22:33:07,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 22:33:07,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 22:33:07,446 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 22:33:07,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 22:33:07,447 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 22:33:07,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 22:33:07,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 22:33:07,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 22:33:07,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 22:33:07,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 22:33:07,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 22:33:07,448 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 22:33:07,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 22:33:07,448 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 22:33:07,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 22:33:07,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 22:33:07,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 22:33:07,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 22:33:07,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:33:07,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 22:33:07,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 22:33:07,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 22:33:07,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 22:33:07,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 22:33:07,450 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 22:33:07,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 22:33:07,451 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 22:33:07,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 22:33:07,451 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 22:33:07,451 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2023-02-14 22:33:07,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:33:07,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:33:07,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:33:07,658 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:33:07,658 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:33:07,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-14 22:33:08,622 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:33:08,754 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:33:08,754 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-14 22:33:08,758 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fadb083b/772802561c074b0b8abe661bffff3806/FLAGa400879aa [2023-02-14 22:33:08,767 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fadb083b/772802561c074b0b8abe661bffff3806 [2023-02-14 22:33:08,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:33:08,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:33:08,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:33:08,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:33:08,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:33:08,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a4011e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08, skipping insertion in model container [2023-02-14 22:33:08,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:33:08,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:33:08,886 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2023-02-14 22:33:08,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:33:08,894 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:33:08,903 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2023-02-14 22:33:08,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:33:08,913 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:33:08,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08 WrapperNode [2023-02-14 22:33:08,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:33:08,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:33:08,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:33:08,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:33:08,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,933 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2023-02-14 22:33:08,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:33:08,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:33:08,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:33:08,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:33:08,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,944 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:33:08,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:33:08,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:33:08,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:33:08,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (1/1) ... [2023-02-14 22:33:08,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:33:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:33:08,966 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) [2023-02-14 22:33:08,968 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 [2023-02-14 22:33:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:33:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-02-14 22:33:08,998 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-02-14 22:33:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:33:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:33:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 22:33:09,047 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:33:09,049 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:33:09,165 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:33:09,169 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:33:09,169 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-14 22:33:09,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:33:09 BoogieIcfgContainer [2023-02-14 22:33:09,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:33:09,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:33:09,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:33:09,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:33:09,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:33:08" (1/3) ... [2023-02-14 22:33:09,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d47eb82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:33:09, skipping insertion in model container [2023-02-14 22:33:09,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:08" (2/3) ... [2023-02-14 22:33:09,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d47eb82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:33:09, skipping insertion in model container [2023-02-14 22:33:09,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:33:09" (3/3) ... [2023-02-14 22:33:09,177 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-02-14 22:33:09,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:33:09,199 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 22:33:09,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:33:09,236 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4481c073, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:33:09,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 22:33:09,239 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) [2023-02-14 22:33:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 22:33:09,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:09,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:09,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:09,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2023-02-14 22:33:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:33:09,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207841834] [2023-02-14 22:33:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:33:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:33:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 22:33:09,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 22:33:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 22:33:09,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 22:33:09,353 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 22:33:09,354 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 22:33:09,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 22:33:09,358 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-02-14 22:33:09,361 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 22:33:09,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:33:09 BoogieIcfgContainer [2023-02-14 22:33:09,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 22:33:09,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 22:33:09,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 22:33:09,381 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 22:33:09,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:33:09" (3/4) ... [2023-02-14 22:33:09,386 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 22:33:09,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 22:33:09,388 INFO L158 Benchmark]: Toolchain (without parser) took 617.25ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 56.2MB in the beginning and 87.7MB in the end (delta: -31.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-14 22:33:09,388 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:33:09,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.05ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 56.0MB in the beginning and 114.9MB in the end (delta: -59.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 22:33:09,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.08ms. Allocated memory is still 146.8MB. Free memory was 114.9MB in the beginning and 113.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:33:09,394 INFO L158 Benchmark]: Boogie Preprocessor took 11.52ms. Allocated memory is still 146.8MB. Free memory was 113.7MB in the beginning and 112.8MB in the end (delta: 858.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:33:09,395 INFO L158 Benchmark]: RCFGBuilder took 225.06ms. Allocated memory is still 146.8MB. Free memory was 112.8MB in the beginning and 103.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 22:33:09,396 INFO L158 Benchmark]: TraceAbstraction took 206.42ms. Allocated memory is still 146.8MB. Free memory was 102.3MB in the beginning and 87.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-14 22:33:09,396 INFO L158 Benchmark]: Witness Printer took 6.34ms. Allocated memory is still 146.8MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:33:09,401 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.05ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 56.0MB in the beginning and 114.9MB in the end (delta: -59.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.08ms. Allocated memory is still 146.8MB. Free memory was 114.9MB in the beginning and 113.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.52ms. Allocated memory is still 146.8MB. Free memory was 113.7MB in the beginning and 112.8MB in the end (delta: 858.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 225.06ms. Allocated memory is still 146.8MB. Free memory was 112.8MB in the beginning and 103.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 206.42ms. Allocated memory is still 146.8MB. Free memory was 102.3MB in the beginning and 87.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 6.34ms. Allocated memory is still 146.8MB. Free memory is still 87.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 36]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 33. Possible FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) VAL [n=1] [L31] CALL, EXPR hanoi(n) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L31] RET, EXPR hanoi(n) VAL [hanoi(n)=1, n=1] [L31] unsigned result = hanoi(n); [L33] COND FALSE !(result+1>0 && result+1 == 1< 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 -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2023-02-14 22:33:11,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:33:11,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:33:11,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:33:11,579 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:33:11,579 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:33:11,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-14 22:33:12,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:33:12,756 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:33:12,757 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-14 22:33:12,779 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f28a3e4d/d8b7df40feee4988b4f22990ab375785/FLAGb711df759 [2023-02-14 22:33:12,791 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f28a3e4d/d8b7df40feee4988b4f22990ab375785 [2023-02-14 22:33:12,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:33:12,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:33:12,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:33:12,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:33:12,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:33:12,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:12,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1493807d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12, skipping insertion in model container [2023-02-14 22:33:12,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:12,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:33:12,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:33:12,936 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2023-02-14 22:33:12,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:33:12,950 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:33:12,964 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2023-02-14 22:33:12,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:33:12,974 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:33:12,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12 WrapperNode [2023-02-14 22:33:12,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:33:12,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:33:12,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:33:12,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:33:12,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:12,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:12,997 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2023-02-14 22:33:12,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:33:12,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:33:12,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:33:12,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:33:13,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,023 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:33:13,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:33:13,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:33:13,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:33:13,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (1/1) ... [2023-02-14 22:33:13,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:33:13,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:33:13,051 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) [2023-02-14 22:33:13,058 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 [2023-02-14 22:33:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:33:13,085 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-02-14 22:33:13,085 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-02-14 22:33:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:33:13,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:33:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-14 22:33:13,142 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:33:13,144 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:33:13,278 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:33:13,284 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:33:13,284 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-14 22:33:13,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:33:13 BoogieIcfgContainer [2023-02-14 22:33:13,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:33:13,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:33:13,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:33:13,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:33:13,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:33:12" (1/3) ... [2023-02-14 22:33:13,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8449b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:33:13, skipping insertion in model container [2023-02-14 22:33:13,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:33:12" (2/3) ... [2023-02-14 22:33:13,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8449b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:33:13, skipping insertion in model container [2023-02-14 22:33:13,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:33:13" (3/3) ... [2023-02-14 22:33:13,299 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-02-14 22:33:13,309 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:33:13,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 22:33:13,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:33:13,351 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a424f27, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:33:13,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 22:33:13,355 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) [2023-02-14 22:33:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 22:33:13,362 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:13,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:13,363 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2023-02-14 22:33:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:13,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122109500] [2023-02-14 22:33:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:33:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:13,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:13,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-14 22:33:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:33:13,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 22:33:13,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:33:13,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 22:33:13,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:13,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122109500] [2023-02-14 22:33:13,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122109500] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:33:13,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:33:13,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 22:33:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577713959] [2023-02-14 22:33:13,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:33:13,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 22:33:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:13,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 22:33:13,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 22:33:13,640 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 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2023-02-14 22:33:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:13,724 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-02-14 22:33:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 22:33:13,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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 [2023-02-14 22:33:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:13,730 INFO L225 Difference]: With dead ends: 32 [2023-02-14 22:33:13,730 INFO L226 Difference]: Without dead ends: 16 [2023-02-14 22:33:13,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 22:33:13,735 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:13,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 51 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:33:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-14 22:33:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-14 22:33:13,757 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) [2023-02-14 22:33:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-02-14 22:33:13,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2023-02-14 22:33:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:13,759 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-02-14 22:33:13,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2023-02-14 22:33:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-02-14 22:33:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 22:33:13,760 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:13,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:13,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-14 22:33:13,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:13,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2023-02-14 22:33:13,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:13,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555399034] [2023-02-14 22:33:13,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:33:13,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:13,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:13,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:13,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-14 22:33:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:33:14,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 22:33:14,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 22:33:14,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:33:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 22:33:14,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:14,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555399034] [2023-02-14 22:33:14,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555399034] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:33:14,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:33:14,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-14 22:33:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424807425] [2023-02-14 22:33:14,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:33:14,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 22:33:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 22:33:14,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-14 22:33:14,544 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 22:33:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:14,820 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-02-14 22:33:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 22:33:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2023-02-14 22:33:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:14,822 INFO L225 Difference]: With dead ends: 28 [2023-02-14 22:33:14,822 INFO L226 Difference]: Without dead ends: 22 [2023-02-14 22:33:14,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-02-14 22:33:14,823 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:14,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 61 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:33:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-14 22:33:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-14 22:33:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 22:33:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-02-14 22:33:14,827 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2023-02-14 22:33:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:14,827 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-02-14 22:33:14,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 22:33:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-02-14 22:33:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 22:33:14,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:14,829 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:14,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-14 22:33:15,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:15,033 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2023-02-14 22:33:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:15,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562835762] [2023-02-14 22:33:15,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:33:15,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:15,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:15,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:15,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 22:33:15,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:33:15,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:33:15,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 22:33:15,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 22:33:15,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:33:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 22:33:16,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:16,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562835762] [2023-02-14 22:33:16,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562835762] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:33:16,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:33:16,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2023-02-14 22:33:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70974874] [2023-02-14 22:33:16,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:33:16,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 22:33:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:16,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 22:33:16,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-02-14 22:33:16,156 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 22:33:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:16,598 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-14 22:33:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 22:33:16,598 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 29 [2023-02-14 22:33:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:16,599 INFO L225 Difference]: With dead ends: 34 [2023-02-14 22:33:16,599 INFO L226 Difference]: Without dead ends: 28 [2023-02-14 22:33:16,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2023-02-14 22:33:16,601 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:16,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 118 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:33:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-14 22:33:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-14 22:33:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 22:33:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-02-14 22:33:16,605 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2023-02-14 22:33:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:16,605 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-02-14 22:33:16,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 22:33:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-02-14 22:33:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 22:33:16,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:16,607 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:16,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-14 22:33:16,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:16,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2023-02-14 22:33:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:16,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832934403] [2023-02-14 22:33:16,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:33:16,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:16,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:16,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:16,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-14 22:33:16,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-14 22:33:16,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:33:16,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 22:33:16,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-14 22:33:17,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:33:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 22:33:18,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:18,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832934403] [2023-02-14 22:33:18,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832934403] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:33:18,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:33:18,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2023-02-14 22:33:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045450257] [2023-02-14 22:33:18,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:33:18,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-14 22:33:18,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-14 22:33:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2023-02-14 22:33:18,530 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2023-02-14 22:33:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:19,193 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-14 22:33:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 22:33:19,194 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 41 [2023-02-14 22:33:19,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:19,195 INFO L225 Difference]: With dead ends: 40 [2023-02-14 22:33:19,195 INFO L226 Difference]: Without dead ends: 34 [2023-02-14 22:33:19,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2023-02-14 22:33:19,197 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:19,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 205 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 22:33:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-14 22:33:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-14 22:33:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-14 22:33:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-02-14 22:33:19,201 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2023-02-14 22:33:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:19,201 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-02-14 22:33:19,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2023-02-14 22:33:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-02-14 22:33:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 22:33:19,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:19,202 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:19,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-14 22:33:19,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:19,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2023-02-14 22:33:19,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:19,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688605328] [2023-02-14 22:33:19,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:33:19,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:19,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:19,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:19,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-14 22:33:19,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:33:19,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:33:19,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-14 22:33:19,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-02-14 22:33:19,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:33:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-14 22:33:22,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:22,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688605328] [2023-02-14 22:33:22,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688605328] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:33:22,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:33:22,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2023-02-14 22:33:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081572344] [2023-02-14 22:33:22,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:33:22,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 22:33:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:22,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 22:33:22,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2023-02-14 22:33:22,227 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2023-02-14 22:33:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:23,130 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2023-02-14 22:33:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 22:33:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) Word has length 53 [2023-02-14 22:33:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:23,132 INFO L225 Difference]: With dead ends: 46 [2023-02-14 22:33:23,132 INFO L226 Difference]: Without dead ends: 40 [2023-02-14 22:33:23,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2023-02-14 22:33:23,134 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 114 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:23,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 300 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 22:33:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-14 22:33:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-14 22:33:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2023-02-14 22:33:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2023-02-14 22:33:23,139 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2023-02-14 22:33:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:23,139 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2023-02-14 22:33:23,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2023-02-14 22:33:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2023-02-14 22:33:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 22:33:23,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:23,141 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:23,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-14 22:33:23,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:23,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2023-02-14 22:33:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:23,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450300064] [2023-02-14 22:33:23,347 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 22:33:23,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:23,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:23,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:23,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-14 22:33:23,402 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-14 22:33:23,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:33:23,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 22:33:23,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-02-14 22:33:23,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:33:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-14 22:33:27,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:27,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450300064] [2023-02-14 22:33:27,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450300064] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:33:27,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:33:27,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2023-02-14 22:33:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153797008] [2023-02-14 22:33:27,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:33:27,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-14 22:33:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-14 22:33:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2023-02-14 22:33:27,137 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-14 22:33:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:28,347 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2023-02-14 22:33:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 22:33:28,348 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) Word has length 65 [2023-02-14 22:33:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:28,349 INFO L225 Difference]: With dead ends: 52 [2023-02-14 22:33:28,349 INFO L226 Difference]: Without dead ends: 46 [2023-02-14 22:33:28,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2023-02-14 22:33:28,351 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 138 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:28,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 443 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 22:33:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-14 22:33:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-02-14 22:33:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2023-02-14 22:33:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2023-02-14 22:33:28,362 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2023-02-14 22:33:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:28,362 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2023-02-14 22:33:28,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-14 22:33:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2023-02-14 22:33:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-14 22:33:28,363 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:28,364 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:28,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-14 22:33:28,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:28,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2023-02-14 22:33:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:28,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947088657] [2023-02-14 22:33:28,600 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 22:33:28,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:28,601 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:28,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 22:33:28,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-14 22:33:28,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:33:28,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-14 22:33:28,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-02-14 22:33:29,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:33:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-14 22:33:33,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:33,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947088657] [2023-02-14 22:33:33,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947088657] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:33:33,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:33:33,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2023-02-14 22:33:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29732666] [2023-02-14 22:33:33,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:33:33,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-14 22:33:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-14 22:33:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2023-02-14 22:33:33,456 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2023-02-14 22:33:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:35,038 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2023-02-14 22:33:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-14 22:33:35,038 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) Word has length 77 [2023-02-14 22:33:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:35,042 INFO L225 Difference]: With dead ends: 58 [2023-02-14 22:33:35,042 INFO L226 Difference]: Without dead ends: 52 [2023-02-14 22:33:35,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2023-02-14 22:33:35,045 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:35,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 556 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 22:33:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-14 22:33:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-14 22:33:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2023-02-14 22:33:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-02-14 22:33:35,062 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2023-02-14 22:33:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:35,064 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-02-14 22:33:35,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2023-02-14 22:33:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2023-02-14 22:33:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-14 22:33:35,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:35,068 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:35,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-14 22:33:35,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:35,269 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2023-02-14 22:33:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:35,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139515651] [2023-02-14 22:33:35,269 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 22:33:35,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:35,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:35,271 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:35,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-14 22:33:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:33:35,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-14 22:33:35,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-02-14 22:33:35,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:33:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-14 22:33:41,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:41,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139515651] [2023-02-14 22:33:41,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139515651] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:33:41,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:33:41,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2023-02-14 22:33:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333330037] [2023-02-14 22:33:41,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:33:41,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-02-14 22:33:41,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:41,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-02-14 22:33:41,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2023-02-14 22:33:41,662 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2023-02-14 22:33:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:43,612 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2023-02-14 22:33:43,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-14 22:33:43,612 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) Word has length 89 [2023-02-14 22:33:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:43,613 INFO L225 Difference]: With dead ends: 64 [2023-02-14 22:33:43,613 INFO L226 Difference]: Without dead ends: 58 [2023-02-14 22:33:43,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2023-02-14 22:33:43,616 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 246 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:43,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 853 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-14 22:33:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-14 22:33:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-14 22:33:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2023-02-14 22:33:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2023-02-14 22:33:43,621 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2023-02-14 22:33:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:43,621 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2023-02-14 22:33:43,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2023-02-14 22:33:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2023-02-14 22:33:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-14 22:33:43,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:43,624 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:43,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-14 22:33:43,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:43,831 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2023-02-14 22:33:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:43,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974210386] [2023-02-14 22:33:43,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:33:43,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:43,833 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:43,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-14 22:33:43,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:33:43,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:33:43,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-14 22:33:43,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-02-14 22:33:44,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:33:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-14 22:33:51,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:33:51,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974210386] [2023-02-14 22:33:51,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974210386] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:33:51,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:33:51,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2023-02-14 22:33:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59326688] [2023-02-14 22:33:51,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:33:51,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2023-02-14 22:33:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:33:51,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2023-02-14 22:33:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2023-02-14 22:33:51,807 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2023-02-14 22:33:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:33:54,210 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2023-02-14 22:33:54,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-14 22:33:54,211 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) Word has length 101 [2023-02-14 22:33:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:33:54,211 INFO L225 Difference]: With dead ends: 70 [2023-02-14 22:33:54,212 INFO L226 Difference]: Without dead ends: 64 [2023-02-14 22:33:54,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2023-02-14 22:33:54,214 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 516 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:33:54,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 890 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-14 22:33:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-14 22:33:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-14 22:33:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2023-02-14 22:33:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2023-02-14 22:33:54,218 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2023-02-14 22:33:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:33:54,219 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2023-02-14 22:33:54,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2023-02-14 22:33:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2023-02-14 22:33:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-14 22:33:54,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:33:54,220 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:33:54,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-14 22:33:54,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:54,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:33:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:33:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2023-02-14 22:33:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:33:54,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051039714] [2023-02-14 22:33:54,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:33:54,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:33:54,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:33:54,428 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:33:54,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-14 22:33:54,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-02-14 22:33:54,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:33:54,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-14 22:33:54,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:33:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-02-14 22:33:55,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:34:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-14 22:34:04,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:34:04,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051039714] [2023-02-14 22:34:04,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051039714] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:34:04,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:34:04,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2023-02-14 22:34:04,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538658074] [2023-02-14 22:34:04,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:34:04,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-02-14 22:34:04,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:34:04,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-02-14 22:34:04,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2023-02-14 22:34:04,253 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2023-02-14 22:34:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:34:07,195 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2023-02-14 22:34:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-14 22:34:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) Word has length 113 [2023-02-14 22:34:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:34:07,197 INFO L225 Difference]: With dead ends: 76 [2023-02-14 22:34:07,197 INFO L226 Difference]: Without dead ends: 70 [2023-02-14 22:34:07,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1274, Invalid=16816, Unknown=0, NotChecked=0, Total=18090 [2023-02-14 22:34:07,198 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 652 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-14 22:34:07,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1113 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-14 22:34:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-14 22:34:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-14 22:34:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2023-02-14 22:34:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2023-02-14 22:34:07,202 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 113 [2023-02-14 22:34:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:34:07,202 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2023-02-14 22:34:07,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2023-02-14 22:34:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2023-02-14 22:34:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-02-14 22:34:07,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:34:07,204 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:34:07,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-14 22:34:07,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:34:07,426 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:34:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:34:07,426 INFO L85 PathProgramCache]: Analyzing trace with hash 685850484, now seen corresponding path program 10 times [2023-02-14 22:34:07,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:34:07,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374128985] [2023-02-14 22:34:07,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:34:07,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:34:07,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:34:07,428 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:34:07,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-14 22:34:07,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:34:07,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:34:07,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-14 22:34:07,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:34:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2023-02-14 22:34:08,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:34:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-14 22:34:19,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:34:19,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374128985] [2023-02-14 22:34:19,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374128985] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:34:19,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:34:19,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2023-02-14 22:34:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653813067] [2023-02-14 22:34:19,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:34:19,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2023-02-14 22:34:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:34:19,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2023-02-14 22:34:19,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2023-02-14 22:34:19,203 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2023-02-14 22:34:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:34:22,563 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2023-02-14 22:34:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-14 22:34:22,564 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) Word has length 125 [2023-02-14 22:34:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:34:22,564 INFO L225 Difference]: With dead ends: 82 [2023-02-14 22:34:22,564 INFO L226 Difference]: Without dead ends: 76 [2023-02-14 22:34:22,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1494, Invalid=20558, Unknown=0, NotChecked=0, Total=22052 [2023-02-14 22:34:22,574 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 594 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-14 22:34:22,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1401 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-14 22:34:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-14 22:34:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-14 22:34:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2023-02-14 22:34:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-14 22:34:22,582 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 125 [2023-02-14 22:34:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:34:22,583 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-14 22:34:22,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2023-02-14 22:34:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-14 22:34:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-02-14 22:34:22,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:34:22,585 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:34:22,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-14 22:34:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:34:22,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:34:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:34:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 11 times [2023-02-14 22:34:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:34:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856014141] [2023-02-14 22:34:22,793 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 22:34:22,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:34:22,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:34:22,794 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:34:22,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-14 22:34:22,939 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2023-02-14 22:34:22,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:34:22,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 92 conjunts are in the unsatisfiable core [2023-02-14 22:34:22,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:34:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-02-14 22:34:24,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:34:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-14 22:34:36,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:34:36,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856014141] [2023-02-14 22:34:36,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856014141] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:34:36,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:34:36,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2023-02-14 22:34:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434083798] [2023-02-14 22:34:36,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:34:36,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2023-02-14 22:34:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:34:36,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2023-02-14 22:34:36,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2023-02-14 22:34:36,893 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2023-02-14 22:34:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:34:40,846 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2023-02-14 22:34:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-02-14 22:34:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) Word has length 137 [2023-02-14 22:34:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:34:40,850 INFO L225 Difference]: With dead ends: 88 [2023-02-14 22:34:40,851 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 22:34:40,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2023-02-14 22:34:40,852 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 834 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 3203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-14 22:34:40,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1444 Invalid, 3203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-14 22:34:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 22:34:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-14 22:34:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2023-02-14 22:34:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2023-02-14 22:34:40,856 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2023-02-14 22:34:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:34:40,857 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2023-02-14 22:34:40,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2023-02-14 22:34:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2023-02-14 22:34:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-14 22:34:40,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:34:40,858 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:34:40,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-14 22:34:41,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:34:41,067 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:34:41,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:34:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 12 times [2023-02-14 22:34:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:34:41,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093498183] [2023-02-14 22:34:41,068 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 22:34:41,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:34:41,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:34:41,069 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:34:41,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-14 22:34:41,239 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2023-02-14 22:34:41,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:34:41,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-14 22:34:41,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:34:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2023-02-14 22:34:42,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:34:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-14 22:34:57,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:34:57,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093498183] [2023-02-14 22:34:57,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093498183] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:34:57,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:34:57,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2023-02-14 22:34:57,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907668896] [2023-02-14 22:34:57,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:34:57,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2023-02-14 22:34:57,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:34:57,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2023-02-14 22:34:57,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2023-02-14 22:34:57,469 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) [2023-02-14 22:35:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:35:02,055 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2023-02-14 22:35:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-02-14 22:35:02,056 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) Word has length 149 [2023-02-14 22:35:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:35:02,057 INFO L225 Difference]: With dead ends: 94 [2023-02-14 22:35:02,057 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 22:35:02,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2023-02-14 22:35:02,059 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 356 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 4039 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 4190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 4039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:35:02,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 2050 Invalid, 4190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 4039 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-14 22:35:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 22:35:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-14 22:35:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2023-02-14 22:35:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2023-02-14 22:35:02,063 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 149 [2023-02-14 22:35:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:35:02,063 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2023-02-14 22:35:02,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) [2023-02-14 22:35:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2023-02-14 22:35:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-02-14 22:35:02,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:35:02,064 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:35:02,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-14 22:35:02,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:35:02,272 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:35:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:35:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1677247156, now seen corresponding path program 13 times [2023-02-14 22:35:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:35:02,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779539021] [2023-02-14 22:35:02,273 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 22:35:02,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:35:02,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:35:02,275 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:35:02,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-14 22:35:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:35:02,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-14 22:35:02,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:35:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2023-02-14 22:35:03,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:35:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-02-14 22:35:21,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:35:21,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779539021] [2023-02-14 22:35:21,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779539021] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:35:21,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:35:21,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2023-02-14 22:35:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213302555] [2023-02-14 22:35:21,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:35:21,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2023-02-14 22:35:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:35:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2023-02-14 22:35:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2023-02-14 22:35:21,178 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) [2023-02-14 22:35:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:35:26,553 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2023-02-14 22:35:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-14 22:35:26,554 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) Word has length 161 [2023-02-14 22:35:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:35:26,555 INFO L225 Difference]: With dead ends: 100 [2023-02-14 22:35:26,555 INFO L226 Difference]: Without dead ends: 94 [2023-02-14 22:35:26,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2023-02-14 22:35:26,557 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1464 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 4602 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 5306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 4602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-14 22:35:26,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 2237 Invalid, 5306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 4602 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-02-14 22:35:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-14 22:35:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-14 22:35:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 64 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 28 states have return successors, (29), 28 states have call predecessors, (29), 2 states have call successors, (29) [2023-02-14 22:35:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2023-02-14 22:35:26,560 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 161 [2023-02-14 22:35:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:35:26,561 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2023-02-14 22:35:26,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) [2023-02-14 22:35:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2023-02-14 22:35:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-02-14 22:35:26,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:35:26,562 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:35:26,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-02-14 22:35:26,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:35:26,769 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:35:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:35:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1199460748, now seen corresponding path program 14 times [2023-02-14 22:35:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:35:26,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177176393] [2023-02-14 22:35:26,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:35:26,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:35:26,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:35:26,771 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:35:26,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-14 22:35:26,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:35:26,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:35:26,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-14 22:35:26,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:35:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2023-02-14 22:35:28,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:35:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-14 22:35:48,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:35:48,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177176393] [2023-02-14 22:35:48,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177176393] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:35:48,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:35:48,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2023-02-14 22:35:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053838708] [2023-02-14 22:35:48,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:35:48,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2023-02-14 22:35:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:35:48,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2023-02-14 22:35:48,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2023-02-14 22:35:48,615 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) [2023-02-14 22:35:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:35:54,716 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2023-02-14 22:35:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-14 22:35:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) Word has length 173 [2023-02-14 22:35:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:35:54,717 INFO L225 Difference]: With dead ends: 106 [2023-02-14 22:35:54,718 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 22:35:54,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2023-02-14 22:35:54,720 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 644 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 5040 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 5331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 5040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-14 22:35:54,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2525 Invalid, 5331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 5040 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-02-14 22:35:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 22:35:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-14 22:35:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 68 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 30 states have return successors, (31), 30 states have call predecessors, (31), 2 states have call successors, (31) [2023-02-14 22:35:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2023-02-14 22:35:54,724 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 173 [2023-02-14 22:35:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:35:54,724 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2023-02-14 22:35:54,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) [2023-02-14 22:35:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2023-02-14 22:35:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-02-14 22:35:54,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:35:54,726 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:35:54,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-02-14 22:35:54,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:35:54,942 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:35:54,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:35:54,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1668253132, now seen corresponding path program 15 times [2023-02-14 22:35:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:35:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543933444] [2023-02-14 22:35:54,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:35:54,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:35:54,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:35:54,944 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:35:54,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-14 22:35:55,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2023-02-14 22:35:55,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:35:55,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 124 conjunts are in the unsatisfiable core [2023-02-14 22:35:55,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:35:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2023-02-14 22:35:57,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:36:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-14 22:36:19,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:36:19,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543933444] [2023-02-14 22:36:19,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543933444] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:36:19,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:36:19,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2023-02-14 22:36:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987181475] [2023-02-14 22:36:19,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:36:19,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2023-02-14 22:36:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:36:19,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2023-02-14 22:36:19,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2023-02-14 22:36:19,832 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) [2023-02-14 22:36:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:36:26,698 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2023-02-14 22:36:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-02-14 22:36:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) Word has length 185 [2023-02-14 22:36:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:36:26,704 INFO L225 Difference]: With dead ends: 112 [2023-02-14 22:36:26,704 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 22:36:26,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2023-02-14 22:36:26,707 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1432 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 5925 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 6608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 5925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-14 22:36:26,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 2871 Invalid, 6608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 5925 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-02-14 22:36:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 22:36:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-14 22:36:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 72 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (33), 32 states have call predecessors, (33), 2 states have call successors, (33) [2023-02-14 22:36:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2023-02-14 22:36:26,710 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 185 [2023-02-14 22:36:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:36:26,710 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2023-02-14 22:36:26,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) [2023-02-14 22:36:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2023-02-14 22:36:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-02-14 22:36:26,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:36:26,712 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:36:26,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-14 22:36:26,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:36:26,917 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:36:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:36:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash 422913524, now seen corresponding path program 16 times [2023-02-14 22:36:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:36:26,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543562833] [2023-02-14 22:36:26,918 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:36:26,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:36:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:36:26,918 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:36:26,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-14 22:36:27,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:36:27,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 22:36:27,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 22:36:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 22:36:27,292 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-14 22:36:27,293 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 22:36:27,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 22:36:27,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-02-14 22:36:27,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:36:27,511 INFO L445 BasicCegarLoop]: Path program histogram: [16, 1] [2023-02-14 22:36:27,513 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 22:36:27,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:36:27 BoogieIcfgContainer [2023-02-14 22:36:27,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 22:36:27,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 22:36:27,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 22:36:27,555 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 22:36:27,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:33:13" (3/4) ... [2023-02-14 22:36:27,556 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 22:36:27,610 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 22:36:27,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 22:36:27,611 INFO L158 Benchmark]: Toolchain (without parser) took 194817.39ms. Allocated memory was 81.8MB in the beginning and 251.7MB in the end (delta: 169.9MB). Free memory was 61.5MB in the beginning and 47.9MB in the end (delta: 13.6MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. [2023-02-14 22:36:27,612 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 58.7MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:36:27,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.71ms. Allocated memory is still 81.8MB. Free memory was 61.4MB in the beginning and 51.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 22:36:27,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.42ms. Allocated memory is still 81.8MB. Free memory was 51.2MB in the beginning and 49.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:36:27,612 INFO L158 Benchmark]: Boogie Preprocessor took 28.34ms. Allocated memory is still 81.8MB. Free memory was 49.6MB in the beginning and 48.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:36:27,615 INFO L158 Benchmark]: RCFGBuilder took 259.08ms. Allocated memory is still 81.8MB. Free memory was 48.6MB in the beginning and 39.0MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 22:36:27,616 INFO L158 Benchmark]: TraceAbstraction took 194266.25ms. Allocated memory was 81.8MB in the beginning and 251.7MB in the end (delta: 169.9MB). Free memory was 38.3MB in the beginning and 52.1MB in the end (delta: -13.8MB). Peak memory consumption was 156.1MB. Max. memory is 16.1GB. [2023-02-14 22:36:27,616 INFO L158 Benchmark]: Witness Printer took 55.96ms. Allocated memory is still 251.7MB. Free memory was 52.1MB in the beginning and 47.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-14 22:36:27,618 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 58.7MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.71ms. Allocated memory is still 81.8MB. Free memory was 61.4MB in the beginning and 51.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.42ms. Allocated memory is still 81.8MB. Free memory was 51.2MB in the beginning and 49.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.34ms. Allocated memory is still 81.8MB. Free memory was 49.6MB in the beginning and 48.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.08ms. Allocated memory is still 81.8MB. Free memory was 48.6MB in the beginning and 39.0MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 194266.25ms. Allocated memory was 81.8MB in the beginning and 251.7MB in the end (delta: 169.9MB). Free memory was 38.3MB in the beginning and 52.1MB in the end (delta: -13.8MB). Peak memory consumption was 156.1MB. Max. memory is 16.1GB. * Witness Printer took 55.96ms. Allocated memory is still 251.7MB. Free memory was 52.1MB in the beginning and 47.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 36]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) VAL [n=32] [L31] CALL, EXPR hanoi(n) VAL [\old(n)=32] [L19] COND FALSE !(n == 1) VAL [\old(n)=32, n=32] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=31] [L19] COND FALSE !(n == 1) VAL [\old(n)=31, n=31] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=30] [L19] COND FALSE !(n == 1) VAL [\old(n)=30, n=30] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=29] [L19] COND FALSE !(n == 1) VAL [\old(n)=29, n=29] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=28] [L19] COND FALSE !(n == 1) VAL [\old(n)=28, n=28] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=27] [L19] COND FALSE !(n == 1) VAL [\old(n)=27, n=27] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=26] [L19] COND FALSE !(n == 1) VAL [\old(n)=26, n=26] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=25] [L19] COND FALSE !(n == 1) VAL [\old(n)=25, n=25] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=24] [L19] COND FALSE !(n == 1) VAL [\old(n)=24, n=24] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=23] [L19] COND FALSE !(n == 1) VAL [\old(n)=23, n=23] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=22] [L19] COND FALSE !(n == 1) VAL [\old(n)=22, n=22] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=21] [L19] COND FALSE !(n == 1) VAL [\old(n)=21, n=21] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=20] [L19] COND FALSE !(n == 1) VAL [\old(n)=20, n=20] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=19] [L19] COND FALSE !(n == 1) VAL [\old(n)=19, n=19] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=18] [L19] COND FALSE !(n == 1) VAL [\old(n)=18, n=18] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=17] [L19] COND FALSE !(n == 1) VAL [\old(n)=17, n=17] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=16] [L19] COND FALSE !(n == 1) VAL [\old(n)=16, n=16] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=15] [L19] COND FALSE !(n == 1) VAL [\old(n)=15, n=15] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=14] [L19] COND FALSE !(n == 1) VAL [\old(n)=14, n=14] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=13] [L19] COND FALSE !(n == 1) VAL [\old(n)=13, n=13] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=12] [L19] COND FALSE !(n == 1) VAL [\old(n)=12, n=12] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=11] [L19] COND FALSE !(n == 1) VAL [\old(n)=11, n=11] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=10] [L19] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=9] [L19] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=2, hanoi(n-1)=1, n=2] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=3, hanoi(n-1)=3, n=3] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=4, hanoi(n-1)=7, n=4] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=5, hanoi(n-1)=15, n=5] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=6, hanoi(n-1)=31, n=6] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=7, hanoi(n-1)=63, n=7] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=8, hanoi(n-1)=127, n=8] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=9, hanoi(n-1)=255, n=9] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=10, hanoi(n-1)=511, n=10] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=11, hanoi(n-1)=1023, n=11] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=12, hanoi(n-1)=2047, n=12] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=13, hanoi(n-1)=4095, n=13] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=14, hanoi(n-1)=8191, n=14] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=15, hanoi(n-1)=16383, n=15] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=16, hanoi(n-1)=32767, n=16] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=17, hanoi(n-1)=65535, n=17] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=18, hanoi(n-1)=131071, n=18] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=19, hanoi(n-1)=262143, n=19] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=20, hanoi(n-1)=524287, n=20] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=21, hanoi(n-1)=1048575, n=21] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=22, hanoi(n-1)=2097151, n=22] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=23, hanoi(n-1)=4194303, n=23] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=24, hanoi(n-1)=8388607, n=24] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=25, hanoi(n-1)=16777215, n=25] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=26, hanoi(n-1)=33554431, n=26] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=27, hanoi(n-1)=67108863, n=27] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=28, hanoi(n-1)=134217727, n=28] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=29, hanoi(n-1)=268435455, n=29] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=30, hanoi(n-1)=536870911, n=30] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=31, hanoi(n-1)=1073741823, n=31] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=32, hanoi(n-1)=2147483647, n=32] [L22] return 2 * (hanoi(n-1)) + 1; [L31] RET, EXPR hanoi(n) VAL [hanoi(n)=-1, n=32] [L31] unsigned result = hanoi(n); [L33] COND FALSE !(result+1>0 && result+1 == 1<