./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 6c24879c 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-?-6c24879 [2022-07-11 23:42:35,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:42:35,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:42:35,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:42:35,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:42:35,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:42:35,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:42:35,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:42:35,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:42:35,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:42:35,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:42:35,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:42:35,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:42:35,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:42:35,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:42:35,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:42:35,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:42:35,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:42:35,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:42:35,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:42:35,986 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:42:35,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:42:35,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:42:35,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:42:35,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:42:35,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:42:35,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:42:35,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:42:35,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:42:36,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:42:36,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:42:36,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:42:36,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:42:36,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:42:36,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:42:36,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:42:36,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:42:36,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:42:36,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:42:36,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:42:36,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:42:36,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:42:36,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:42:36,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:42:36,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:42:36,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:42:36,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:42:36,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:42:36,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:42:36,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:42:36,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:42:36,038 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:42:36,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:42:36,039 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:42:36,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:42:36,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:42:36,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:42:36,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:42:36,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:42:36,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:42:36,040 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:42:36,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:42:36,041 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:42:36,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:42:36,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:42:36,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:42:36,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:42:36,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:42:36,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:42:36,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:42:36,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:42:36,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:42:36,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:42:36,043 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:42:36,043 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:42:36,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:42:36,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2022-07-11 23:42:36,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:42:36,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:42:36,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:42:36,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:42:36,300 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:42:36,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2022-07-11 23:42:36,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c844b545/a0b9c3fd292b4e92b77d172c7bcf6dd4/FLAG6954008d1 [2022-07-11 23:42:36,751 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:42:36,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2022-07-11 23:42:36,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c844b545/a0b9c3fd292b4e92b77d172c7bcf6dd4/FLAG6954008d1 [2022-07-11 23:42:36,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c844b545/a0b9c3fd292b4e92b77d172c7bcf6dd4 [2022-07-11 23:42:36,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:42:36,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:42:36,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:42:36,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:42:36,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:42:36,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:36,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fcb906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36, skipping insertion in model container [2022-07-11 23:42:36,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:36,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:42:36,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:42:36,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2022-07-11 23:42:36,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:42:36,955 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:42:36,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2022-07-11 23:42:36,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:42:36,982 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:42:36,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36 WrapperNode [2022-07-11 23:42:36,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:42:36,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:42:36,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:42:36,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:42:36,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:36,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,011 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2022-07-11 23:42:37,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:42:37,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:42:37,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:42:37,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:42:37,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:42:37,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:42:37,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:42:37,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:42:37,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (1/1) ... [2022-07-11 23:42:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:42:37,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:42:37,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:42:37,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:42:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:42:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2022-07-11 23:42:37,112 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2022-07-11 23:42:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:42:37,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:42:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:42:37,163 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:42:37,165 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:42:37,281 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:42:37,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:42:37,286 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-11 23:42:37,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:37 BoogieIcfgContainer [2022-07-11 23:42:37,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:42:37,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:42:37,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:42:37,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:42:37,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:42:36" (1/3) ... [2022-07-11 23:42:37,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97b5900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:42:37, skipping insertion in model container [2022-07-11 23:42:37,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:36" (2/3) ... [2022-07-11 23:42:37,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97b5900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:42:37, skipping insertion in model container [2022-07-11 23:42:37,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:37" (3/3) ... [2022-07-11 23:42:37,294 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2022-07-11 23:42:37,306 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:42:37,306 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:42:37,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:42:37,368 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d602739, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71bfa506 [2022-07-11 23:42:37,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:42:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-11 23:42:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-11 23:42:37,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:37,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:37,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2022-07-11 23:42:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:42:37,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477559426] [2022-07-11 23:42:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:42:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:42:37,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:42:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:42:37,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-11 23:42:37,536 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:42:37,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:42:37,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:42:37,542 INFO L356 BasicCegarLoop]: Path program histogram: [1] [2022-07-11 23:42:37,546 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:42:37,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:42:37 BoogieIcfgContainer [2022-07-11 23:42:37,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:42:37,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:42:37,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:42:37,573 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:42:37,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:37" (3/4) ... [2022-07-11 23:42:37,577 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-11 23:42:37,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:42:37,578 INFO L158 Benchmark]: Toolchain (without parser) took 808.25ms. Allocated memory is still 100.7MB. Free memory was 68.4MB in the beginning and 49.8MB in the end (delta: 18.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2022-07-11 23:42:37,579 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 39.5MB in the beginning and 39.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:42:37,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.82ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 76.0MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:42:37,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 100.7MB. Free memory was 76.0MB in the beginning and 74.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:42:37,581 INFO L158 Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 74.0MB in the end (delta: 487.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:42:37,586 INFO L158 Benchmark]: RCFGBuilder took 252.67ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 64.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:42:37,586 INFO L158 Benchmark]: TraceAbstraction took 282.26ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 50.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 23:42:37,588 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 49.8MB in the end (delta: 486.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:42:37,595 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.21ms. Allocated memory is still 83.9MB. Free memory was 39.5MB in the beginning and 39.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.82ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 76.0MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 100.7MB. Free memory was 76.0MB in the beginning and 74.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.49ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 74.0MB in the end (delta: 487.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 252.67ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 64.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 282.26ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 50.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 49.8MB in the end (delta: 486.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 [2022-07-11 23:42:40,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:42:40,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:42:40,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:42:40,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:42:40,043 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:42:40,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2022-07-11 23:42:40,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bee3b229/63ff3fd0bb3842e9a9668a42a6988e2c/FLAGdbd18f33e [2022-07-11 23:42:40,554 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:42:40,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2022-07-11 23:42:40,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bee3b229/63ff3fd0bb3842e9a9668a42a6988e2c/FLAGdbd18f33e [2022-07-11 23:42:40,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bee3b229/63ff3fd0bb3842e9a9668a42a6988e2c [2022-07-11 23:42:40,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:42:40,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:42:40,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:42:40,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:42:40,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:42:40,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9b461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40, skipping insertion in model container [2022-07-11 23:42:40,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:42:40,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:42:40,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2022-07-11 23:42:40,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:42:40,719 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:42:40,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2022-07-11 23:42:40,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:42:40,743 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:42:40,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40 WrapperNode [2022-07-11 23:42:40,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:42:40,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:42:40,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:42:40,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:42:40,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,772 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-07-11 23:42:40,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:42:40,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:42:40,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:42:40,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:42:40,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:42:40,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:42:40,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:42:40,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:42:40,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (1/1) ... [2022-07-11 23:42:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:42:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:42:40,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:42:40,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:42:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:42:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2022-07-11 23:42:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2022-07-11 23:42:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:42:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:42:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:42:40,934 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:42:40,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:42:41,074 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:42:41,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:42:41,082 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-11 23:42:41,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:41 BoogieIcfgContainer [2022-07-11 23:42:41,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:42:41,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:42:41,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:42:41,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:42:41,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:42:40" (1/3) ... [2022-07-11 23:42:41,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef496bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:42:41, skipping insertion in model container [2022-07-11 23:42:41,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:40" (2/3) ... [2022-07-11 23:42:41,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef496bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:42:41, skipping insertion in model container [2022-07-11 23:42:41,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:41" (3/3) ... [2022-07-11 23:42:41,093 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2022-07-11 23:42:41,106 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:42:41,107 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:42:41,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:42:41,178 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d8f5f1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62f89784 [2022-07-11 23:42:41,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:42:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-11 23:42:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-11 23:42:41,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:41,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:41,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2022-07-11 23:42:41,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:41,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445259416] [2022-07-11 23:42:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:41,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:42:41,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-11 23:42:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:41,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:42:41,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:42:41,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:42:41,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:41,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445259416] [2022-07-11 23:42:41,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445259416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:42:41,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:42:41,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:42:41,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277071444] [2022-07-11 23:42:41,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:42:41,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:42:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:41,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:42:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:42:41,523 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) [2022-07-11 23:42:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:41,649 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-07-11 23:42:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:42:41,651 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 [2022-07-11 23:42:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:41,657 INFO L225 Difference]: With dead ends: 32 [2022-07-11 23:42:41,657 INFO L226 Difference]: Without dead ends: 16 [2022-07-11 23:42:41,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:42:41,665 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:41,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 51 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:42:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-11 23:42:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-11 23:42:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:42:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-07-11 23:42:41,711 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-07-11 23:42:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:41,711 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-07-11 23:42:41,720 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) [2022-07-11 23:42:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-07-11 23:42:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-11 23:42:41,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:41,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:41,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:42:41,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:42:41,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:41,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2022-07-11 23:42:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:41,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702580155] [2022-07-11 23:42:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:41,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:41,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:41,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:42:41,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-11 23:42:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:41,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:42:41,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:42:42,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:42:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:42:42,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:42,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702580155] [2022-07-11 23:42:42,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702580155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:42:42,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:42:42,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-07-11 23:42:42,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892772643] [2022-07-11 23:42:42,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:42:42,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:42:42,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:42:42,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:42:42,652 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) [2022-07-11 23:42:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:42,943 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-11 23:42:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:42:42,945 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 [2022-07-11 23:42:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:42,945 INFO L225 Difference]: With dead ends: 28 [2022-07-11 23:42:42,945 INFO L226 Difference]: Without dead ends: 22 [2022-07-11 23:42:42,946 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 [2022-07-11 23:42:42,947 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:42,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-07-11 23:42:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-11 23:42:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-11 23:42:42,958 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) [2022-07-11 23:42:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-11 23:42:42,960 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-07-11 23:42:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:42,961 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-11 23:42:42,961 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) [2022-07-11 23:42:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-07-11 23:42:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:42:42,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:42,962 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:42,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:42:43,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:42:43,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2022-07-11 23:42:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:43,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583222178] [2022-07-11 23:42:43,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:42:43,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:43,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:43,174 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:42:43,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-11 23:42:43,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:42:43,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:42:43,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-11 23:42:43,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:42:43,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:42:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 23:42:44,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583222178] [2022-07-11 23:42:44,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583222178] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:42:44,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:42:44,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2022-07-11 23:42:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202881506] [2022-07-11 23:42:44,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:42:44,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-11 23:42:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:44,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-11 23:42:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2022-07-11 23:42:44,479 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) [2022-07-11 23:42:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:45,076 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-07-11 23:42:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 23:42:45,076 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 [2022-07-11 23:42:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:45,077 INFO L225 Difference]: With dead ends: 34 [2022-07-11 23:42:45,077 INFO L226 Difference]: Without dead ends: 28 [2022-07-11 23:42:45,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=1229, Unknown=0, NotChecked=0, Total=1406 [2022-07-11 23:42:45,079 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:45,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 171 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2022-07-11 23:42:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-11 23:42:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-11 23:42:45,084 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) [2022-07-11 23:42:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-07-11 23:42:45,085 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2022-07-11 23:42:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:45,085 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-07-11 23:42:45,086 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) [2022-07-11 23:42:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-07-11 23:42:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:42:45,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:45,087 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:45,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:42:45,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:42:45,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2022-07-11 23:42:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:45,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749193512] [2022-07-11 23:42:45,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:42:45,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:45,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:42:45,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-11 23:42:45,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-11 23:42:45,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:42:45,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-11 23:42:45,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-11 23:42:45,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:42:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:42:47,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:47,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749193512] [2022-07-11 23:42:47,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749193512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:42:47,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:42:47,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2022-07-11 23:42:47,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113665551] [2022-07-11 23:42:47,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:42:47,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-11 23:42:47,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:47,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-11 23:42:47,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2022-07-11 23:42:47,354 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) [2022-07-11 23:42:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:47,965 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-07-11 23:42:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-11 23:42:47,965 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 [2022-07-11 23:42:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:47,966 INFO L225 Difference]: With dead ends: 40 [2022-07-11 23:42:47,966 INFO L226 Difference]: Without dead ends: 34 [2022-07-11 23:42:47,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2022-07-11 23:42:47,969 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:47,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 185 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 194 Invalid, 0 Unknown, 155 Unchecked, 0.2s Time] [2022-07-11 23:42:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-11 23:42:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-11 23:42:47,974 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) [2022-07-11 23:42:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-07-11 23:42:47,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2022-07-11 23:42:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:47,976 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-07-11 23:42:47,976 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) [2022-07-11 23:42:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-07-11 23:42:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:42:47,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:47,978 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:47,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-11 23:42:48,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:42:48,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2022-07-11 23:42:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:48,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244579606] [2022-07-11 23:42:48,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:42:48,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:48,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:48,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:42:48,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-11 23:42:48,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:42:48,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:42:48,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-11 23:42:48,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-11 23:42:48,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:42:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-11 23:42:51,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:51,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244579606] [2022-07-11 23:42:51,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244579606] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:42:51,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:42:51,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2022-07-11 23:42:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285978012] [2022-07-11 23:42:51,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:42:51,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-11 23:42:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-11 23:42:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2022-07-11 23:42:51,165 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) [2022-07-11 23:42:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:51,934 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-07-11 23:42:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-11 23:42:51,935 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 [2022-07-11 23:42:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:51,936 INFO L225 Difference]: With dead ends: 46 [2022-07-11 23:42:51,936 INFO L226 Difference]: Without dead ends: 40 [2022-07-11 23:42:51,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2022-07-11 23:42:51,938 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:51,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 299 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 338 Invalid, 0 Unknown, 289 Unchecked, 0.2s Time] [2022-07-11 23:42:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-11 23:42:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-11 23:42:51,944 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) [2022-07-11 23:42:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-07-11 23:42:51,945 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2022-07-11 23:42:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:51,945 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-07-11 23:42:51,946 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) [2022-07-11 23:42:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-07-11 23:42:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:42:51,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:51,948 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:51,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-11 23:42:52,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:42:52,151 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:52,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:52,152 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2022-07-11 23:42:52,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:52,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82417654] [2022-07-11 23:42:52,152 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:42:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:52,154 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:42:52,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-11 23:42:52,204 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-11 23:42:52,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:42:52,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-11 23:42:52,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-11 23:42:52,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:42:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-11 23:42:56,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:56,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82417654] [2022-07-11 23:42:56,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82417654] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:42:56,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:42:56,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2022-07-11 23:42:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497077188] [2022-07-11 23:42:56,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:42:56,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-11 23:42:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:56,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-11 23:42:56,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2022-07-11 23:42:56,154 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) [2022-07-11 23:42:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:57,148 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-07-11 23:42:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-11 23:42:57,149 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 [2022-07-11 23:42:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:57,151 INFO L225 Difference]: With dead ends: 52 [2022-07-11 23:42:57,151 INFO L226 Difference]: Without dead ends: 46 [2022-07-11 23:42:57,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2022-07-11 23:42:57,153 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:57,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 364 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 370 Invalid, 0 Unknown, 456 Unchecked, 0.3s Time] [2022-07-11 23:42:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-11 23:42:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-11 23:42:57,159 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) [2022-07-11 23:42:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-07-11 23:42:57,160 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2022-07-11 23:42:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:57,161 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-07-11 23:42:57,161 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) [2022-07-11 23:42:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-07-11 23:42:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:42:57,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:57,163 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:57,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:42:57,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:42:57,368 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2022-07-11 23:42:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:57,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229687260] [2022-07-11 23:42:57,368 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:42:57,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:57,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:57,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:42:57,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-11 23:42:57,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-07-11 23:42:57,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:42:57,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-11 23:42:57,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-11 23:42:57,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:43:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-11 23:43:02,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:43:02,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229687260] [2022-07-11 23:43:02,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229687260] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:43:02,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:43:02,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2022-07-11 23:43:02,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624856573] [2022-07-11 23:43:02,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:43:02,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-11 23:43:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:43:02,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-11 23:43:02,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2022-07-11 23:43:02,440 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) [2022-07-11 23:43:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:03,788 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-07-11 23:43:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-11 23:43:03,791 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 [2022-07-11 23:43:03,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:03,794 INFO L225 Difference]: With dead ends: 58 [2022-07-11 23:43:03,794 INFO L226 Difference]: Without dead ends: 52 [2022-07-11 23:43:03,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2022-07-11 23:43:03,802 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:03,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 647 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 629 Invalid, 0 Unknown, 650 Unchecked, 0.4s Time] [2022-07-11 23:43:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-11 23:43:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-11 23:43:03,809 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) [2022-07-11 23:43:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-07-11 23:43:03,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2022-07-11 23:43:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:03,811 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-07-11 23:43:03,811 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) [2022-07-11 23:43:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-07-11 23:43:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-11 23:43:03,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:03,813 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:03,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:43:04,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:43:04,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2022-07-11 23:43:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:43:04,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507720760] [2022-07-11 23:43:04,016 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:43:04,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:43:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:43:04,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:43:04,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-11 23:43:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:04,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-11 23:43:04,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:43:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-07-11 23:43:04,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:43:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-11 23:43:10,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:43:10,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507720760] [2022-07-11 23:43:10,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507720760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:43:10,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:43:10,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2022-07-11 23:43:10,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092324147] [2022-07-11 23:43:10,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:43:10,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-11 23:43:10,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:43:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-11 23:43:10,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2022-07-11 23:43:10,871 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) [2022-07-11 23:43:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:12,390 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-07-11 23:43:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-11 23:43:12,391 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 [2022-07-11 23:43:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:12,392 INFO L225 Difference]: With dead ends: 64 [2022-07-11 23:43:12,392 INFO L226 Difference]: Without dead ends: 58 [2022-07-11 23:43:12,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2022-07-11 23:43:12,395 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 127 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 792 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:12,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 774 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 710 Invalid, 0 Unknown, 792 Unchecked, 0.4s Time] [2022-07-11 23:43:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-11 23:43:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-11 23:43:12,402 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) [2022-07-11 23:43:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-07-11 23:43:12,403 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2022-07-11 23:43:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:12,403 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-07-11 23:43:12,403 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) [2022-07-11 23:43:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-07-11 23:43:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-11 23:43:12,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:12,405 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:12,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:43:12,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:43:12,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2022-07-11 23:43:12,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:43:12,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76125250] [2022-07-11 23:43:12,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:43:12,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:43:12,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:43:12,613 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:43:12,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-11 23:43:12,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:43:12,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:43:12,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-11 23:43:12,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:43:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-07-11 23:43:13,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:43:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-11 23:43:20,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:43:20,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76125250] [2022-07-11 23:43:20,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76125250] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:43:20,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:43:20,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2022-07-11 23:43:20,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307687010] [2022-07-11 23:43:20,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:43:20,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-11 23:43:20,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:43:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-11 23:43:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2022-07-11 23:43:20,975 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) [2022-07-11 23:43:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:22,945 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-07-11 23:43:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-11 23:43:22,946 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 [2022-07-11 23:43:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:22,947 INFO L225 Difference]: With dead ends: 70 [2022-07-11 23:43:22,947 INFO L226 Difference]: Without dead ends: 64 [2022-07-11 23:43:22,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2022-07-11 23:43:22,951 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 123 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1169 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:22,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 885 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 800 Invalid, 0 Unknown, 1169 Unchecked, 0.5s Time] [2022-07-11 23:43:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-11 23:43:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-11 23:43:22,958 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) [2022-07-11 23:43:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-11 23:43:22,959 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2022-07-11 23:43:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:22,959 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-11 23:43:22,960 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) [2022-07-11 23:43:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-11 23:43:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-11 23:43:22,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:22,961 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:22,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-11 23:43:23,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:43:23,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2022-07-11 23:43:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:43:23,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748400741] [2022-07-11 23:43:23,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:43:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:43:23,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:43:23,170 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:43:23,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-11 23:43:23,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-07-11 23:43:23,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:43:23,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-11 23:43:23,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:43:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-11 23:43:24,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:43:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-11 23:43:33,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:43:33,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748400741] [2022-07-11 23:43:33,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748400741] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:43:33,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:43:33,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2022-07-11 23:43:33,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395319493] [2022-07-11 23:43:33,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:43:33,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-11 23:43:33,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:43:33,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-11 23:43:33,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2022-07-11 23:43:33,583 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) [2022-07-11 23:43:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:35,538 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2022-07-11 23:43:35,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-11 23:43:35,538 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 [2022-07-11 23:43:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:35,539 INFO L225 Difference]: With dead ends: 71 [2022-07-11 23:43:35,539 INFO L226 Difference]: Without dead ends: 67 [2022-07-11 23:43:35,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2227 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1185, Invalid=15845, Unknown=0, NotChecked=0, Total=17030 [2022-07-11 23:43:35,542 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 377 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1314 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:35,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1183 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 1012 Invalid, 0 Unknown, 1314 Unchecked, 0.6s Time] [2022-07-11 23:43:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-11 23:43:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-07-11 23:43:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 19 states have return successors, (20), 19 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-11 23:43:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-07-11 23:43:35,548 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 113 [2022-07-11 23:43:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:35,548 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-07-11 23:43:35,549 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) [2022-07-11 23:43:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-07-11 23:43:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-11 23:43:35,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:35,550 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:35,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-11 23:43:35,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:43:35,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:35,763 INFO L85 PathProgramCache]: Analyzing trace with hash 79612228, now seen corresponding path program 10 times [2022-07-11 23:43:35,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:43:35,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761340959] [2022-07-11 23:43:35,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:43:35,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:43:35,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:43:35,765 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:43:35,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-11 23:43:35,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:43:35,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:43:35,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-11 23:43:35,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:43:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-07-11 23:43:36,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:43:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-11 23:43:47,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:43:47,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761340959] [2022-07-11 23:43:47,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761340959] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:43:47,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:43:47,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 60] total 101 [2022-07-11 23:43:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097746424] [2022-07-11 23:43:47,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:43:47,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-07-11 23:43:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:43:47,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-07-11 23:43:47,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=9734, Unknown=0, NotChecked=0, Total=10100 [2022-07-11 23:43:47,383 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 101 states, 100 states have (on average 1.24) internal successors, (124), 63 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 38 states have return successors, (38), 38 states have call predecessors, (38), 21 states have call successors, (38) [2022-07-11 23:43:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:52,500 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-07-11 23:43:52,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-11 23:43:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 1.24) internal successors, (124), 63 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 38 states have return successors, (38), 38 states have call predecessors, (38), 21 states have call successors, (38) Word has length 119 [2022-07-11 23:43:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:52,502 INFO L225 Difference]: With dead ends: 79 [2022-07-11 23:43:52,502 INFO L226 Difference]: Without dead ends: 73 [2022-07-11 23:43:52,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2676 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1011, Invalid=19295, Unknown=0, NotChecked=0, Total=20306 [2022-07-11 23:43:52,504 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 221 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1179 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:52,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1339 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1118 Invalid, 0 Unknown, 1179 Unchecked, 0.6s Time] [2022-07-11 23:43:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-11 23:43:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-11 23:43:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-11 23:43:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-07-11 23:43:52,510 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 119 [2022-07-11 23:43:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:52,511 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-07-11 23:43:52,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 1.24) internal successors, (124), 63 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 38 states have return successors, (38), 38 states have call predecessors, (38), 21 states have call successors, (38) [2022-07-11 23:43:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-07-11 23:43:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-11 23:43:52,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:52,513 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:52,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:43:52,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:43:52,722 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash 720478468, now seen corresponding path program 11 times [2022-07-11 23:43:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:43:52,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711721572] [2022-07-11 23:43:52,723 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:43:52,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:43:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:43:52,724 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:43:52,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-11 23:43:52,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2022-07-11 23:43:52,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:43:52,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-11 23:43:52,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:43:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2022-07-11 23:43:54,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:44:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-11 23:44:06,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:44:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711721572] [2022-07-11 23:44:06,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711721572] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:44:06,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:44:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 66] total 111 [2022-07-11 23:44:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209451665] [2022-07-11 23:44:06,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:44:06,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-07-11 23:44:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:44:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-07-11 23:44:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=11806, Unknown=0, NotChecked=0, Total=12210 [2022-07-11 23:44:06,556 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 111 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 69 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 42 states have return successors, (42), 42 states have call predecessors, (42), 23 states have call successors, (42) [2022-07-11 23:44:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:08,965 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-11 23:44:08,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-11 23:44:08,965 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 69 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 42 states have return successors, (42), 42 states have call predecessors, (42), 23 states have call successors, (42) Word has length 131 [2022-07-11 23:44:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:08,966 INFO L225 Difference]: With dead ends: 80 [2022-07-11 23:44:08,966 INFO L226 Difference]: Without dead ends: 76 [2022-07-11 23:44:08,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3007 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1509, Invalid=21443, Unknown=0, NotChecked=0, Total=22952 [2022-07-11 23:44:08,968 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1798 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:08,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1626 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1409 Invalid, 0 Unknown, 1798 Unchecked, 0.6s Time] [2022-07-11 23:44:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-11 23:44:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-11 23:44:08,973 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) [2022-07-11 23:44:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-07-11 23:44:08,974 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 131 [2022-07-11 23:44:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:08,974 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-07-11 23:44:08,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 69 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 42 states have return successors, (42), 42 states have call predecessors, (42), 23 states have call successors, (42) [2022-07-11 23:44:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-07-11 23:44:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-11 23:44:08,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:08,984 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:08,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:44:09,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:44:09,191 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:09,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 12 times [2022-07-11 23:44:09,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:44:09,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104662758] [2022-07-11 23:44:09,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:44:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:44:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:44:09,194 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:44:09,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-11 23:44:09,363 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-07-11 23:44:09,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:44:09,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-11 23:44:09,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:44:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-07-11 23:44:10,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:44:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-11 23:44:24,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:44:24,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104662758] [2022-07-11 23:44:24,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104662758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:44:24,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:44:24,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2022-07-11 23:44:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57640935] [2022-07-11 23:44:24,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:44:24,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2022-07-11 23:44:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:44:24,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-07-11 23:44:24,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2022-07-11 23:44:24,101 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) [2022-07-11 23:44:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:27,152 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-07-11 23:44:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-11 23:44:27,153 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 [2022-07-11 23:44:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:27,154 INFO L225 Difference]: With dead ends: 88 [2022-07-11 23:44:27,154 INFO L226 Difference]: Without dead ends: 82 [2022-07-11 23:44:27,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2022-07-11 23:44:27,156 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 160 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 3732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2058 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:27,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1719 Invalid, 3732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1398 Invalid, 0 Unknown, 2058 Unchecked, 0.7s Time] [2022-07-11 23:44:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-11 23:44:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-11 23:44:27,160 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) [2022-07-11 23:44:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2022-07-11 23:44:27,161 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2022-07-11 23:44:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:27,163 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2022-07-11 23:44:27,163 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) [2022-07-11 23:44:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2022-07-11 23:44:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-11 23:44:27,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:27,165 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:27,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-11 23:44:27,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:44:27,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 13 times [2022-07-11 23:44:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:44:27,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643445972] [2022-07-11 23:44:27,376 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:44:27,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:44:27,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:44:27,377 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:44:27,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-11 23:44:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:27,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-11 23:44:27,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:44:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2022-07-11 23:44:28,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:44:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-07-11 23:44:44,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:44:44,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643445972] [2022-07-11 23:44:44,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643445972] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:44:44,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:44:44,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2022-07-11 23:44:44,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960569206] [2022-07-11 23:44:44,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:44:44,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-11 23:44:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:44:44,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-11 23:44:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2022-07-11 23:44:44,790 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) [2022-07-11 23:44:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:48,581 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-07-11 23:44:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-11 23:44:48,581 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 [2022-07-11 23:44:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:48,582 INFO L225 Difference]: With dead ends: 94 [2022-07-11 23:44:48,583 INFO L226 Difference]: Without dead ends: 88 [2022-07-11 23:44:48,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2022-07-11 23:44:48,590 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 558 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 953 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 5133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 953 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2382 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:48,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1860 Invalid, 5133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [953 Valid, 1798 Invalid, 0 Unknown, 2382 Unchecked, 1.0s Time] [2022-07-11 23:44:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-11 23:44:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-11 23:44:48,598 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) [2022-07-11 23:44:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-11 23:44:48,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 149 [2022-07-11 23:44:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:48,599 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-11 23:44:48,599 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) [2022-07-11 23:44:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-11 23:44:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-11 23:44:48,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:48,601 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:48,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-11 23:44:48,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:44:48,807 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1677247156, now seen corresponding path program 14 times [2022-07-11 23:44:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:44:48,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676525347] [2022-07-11 23:44:48,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:44:48,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:44:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:44:48,810 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:44:48,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-11 23:44:48,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:44:48,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:44:48,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 108 conjunts are in the unsatisfiable core [2022-07-11 23:44:48,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:44:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-07-11 23:44:50,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-11 23:45:09,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:45:09,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676525347] [2022-07-11 23:45:09,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676525347] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:09,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:45:09,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2022-07-11 23:45:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792561125] [2022-07-11 23:45:09,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:09,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-07-11 23:45:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:45:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-07-11 23:45:09,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2022-07-11 23:45:09,148 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) [2022-07-11 23:45:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:13,488 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-07-11 23:45:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-11 23:45:13,489 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 [2022-07-11 23:45:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:13,489 INFO L225 Difference]: With dead ends: 100 [2022-07-11 23:45:13,489 INFO L226 Difference]: Without dead ends: 94 [2022-07-11 23:45:13,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2022-07-11 23:45:13,492 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 510 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 6040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2731 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:13,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2341 Invalid, 6040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 2472 Invalid, 0 Unknown, 2731 Unchecked, 1.1s Time] [2022-07-11 23:45:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-11 23:45:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-11 23:45:13,496 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) [2022-07-11 23:45:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-07-11 23:45:13,497 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 161 [2022-07-11 23:45:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:13,498 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-07-11 23:45:13,498 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) [2022-07-11 23:45:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-07-11 23:45:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-11 23:45:13,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:13,499 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:13,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:13,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:45:13,707 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1199460748, now seen corresponding path program 15 times [2022-07-11 23:45:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:45:13,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110857825] [2022-07-11 23:45:13,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:45:13,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:45:13,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:45:13,709 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:45:13,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-11 23:45:14,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-07-11 23:45:14,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:45:14,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-11 23:45:14,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2022-07-11 23:45:15,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-11 23:45:37,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:45:37,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110857825] [2022-07-11 23:45:37,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110857825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:37,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:45:37,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2022-07-11 23:45:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507892843] [2022-07-11 23:45:37,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:37,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2022-07-11 23:45:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:45:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2022-07-11 23:45:37,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2022-07-11 23:45:37,014 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) [2022-07-11 23:45:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:41,686 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2022-07-11 23:45:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-07-11 23:45:41,687 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 [2022-07-11 23:45:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:41,688 INFO L225 Difference]: With dead ends: 106 [2022-07-11 23:45:41,688 INFO L226 Difference]: Without dead ends: 100 [2022-07-11 23:45:41,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2022-07-11 23:45:41,691 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 575 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 925 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 6205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 925 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3246 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:41,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 2435 Invalid, 6205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [925 Valid, 2034 Invalid, 0 Unknown, 3246 Unchecked, 1.0s Time] [2022-07-11 23:45:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-11 23:45:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-11 23:45:41,695 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) [2022-07-11 23:45:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-07-11 23:45:41,696 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 173 [2022-07-11 23:45:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:41,696 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-07-11 23:45:41,697 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) [2022-07-11 23:45:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-07-11 23:45:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-11 23:45:41,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:41,698 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:41,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:41,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:45:41,909 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:41,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:41,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1668253132, now seen corresponding path program 16 times [2022-07-11 23:45:41,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:45:41,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189984656] [2022-07-11 23:45:41,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:45:41,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:45:41,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:45:41,917 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:45:41,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-11 23:45:42,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:45:42,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:45:42,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 124 conjunts are in the unsatisfiable core [2022-07-11 23:45:42,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2022-07-11 23:45:44,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-07-11 23:46:08,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:46:08,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189984656] [2022-07-11 23:46:08,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189984656] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:08,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:46:08,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2022-07-11 23:46:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770239065] [2022-07-11 23:46:08,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:08,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2022-07-11 23:46:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:46:08,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2022-07-11 23:46:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2022-07-11 23:46:08,669 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) [2022-07-11 23:46:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:14,052 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2022-07-11 23:46:14,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-07-11 23:46:14,053 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 [2022-07-11 23:46:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:14,054 INFO L225 Difference]: With dead ends: 112 [2022-07-11 23:46:14,054 INFO L226 Difference]: Without dead ends: 106 [2022-07-11 23:46:14,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2022-07-11 23:46:14,058 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 411 mSDsluCounter, 3089 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 7075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3693 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:14,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 3126 Invalid, 7075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2661 Invalid, 0 Unknown, 3693 Unchecked, 1.2s Time] [2022-07-11 23:46:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-11 23:46:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-11 23:46:14,062 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) [2022-07-11 23:46:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-07-11 23:46:14,062 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 185 [2022-07-11 23:46:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:14,063 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-07-11 23:46:14,063 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) [2022-07-11 23:46:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-07-11 23:46:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-11 23:46:14,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:14,065 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:14,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:14,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:46:14,272 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash 422913524, now seen corresponding path program 17 times [2022-07-11 23:46:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:46:14,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967516940] [2022-07-11 23:46:14,273 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:46:14,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:46:14,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:46:14,274 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:46:14,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-11 23:46:14,628 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-07-11 23:46:14,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-11 23:46:14,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:46:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:46:14,774 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-11 23:46:14,774 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:46:14,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:46:14,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:14,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:46:14,991 INFO L356 BasicCegarLoop]: Path program histogram: [17, 1] [2022-07-11 23:46:14,994 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:46:15,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:46:15 BoogieIcfgContainer [2022-07-11 23:46:15,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:46:15,045 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:46:15,045 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:46:15,045 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:46:15,046 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:41" (3/4) ... [2022-07-11 23:46:15,047 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-11 23:46:15,131 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:46:15,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:46:15,132 INFO L158 Benchmark]: Toolchain (without parser) took 214552.18ms. Allocated memory was 54.5MB in the beginning and 146.8MB in the end (delta: 92.3MB). Free memory was 32.0MB in the beginning and 62.9MB in the end (delta: -30.9MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2022-07-11 23:46:15,132 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:46:15,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.94ms. Allocated memory is still 54.5MB. Free memory was 31.9MB in the beginning and 33.7MB in the end (delta: -1.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:15,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.67ms. Allocated memory is still 54.5MB. Free memory was 33.7MB in the beginning and 32.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:15,136 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 54.5MB. Free memory was 32.3MB in the beginning and 31.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:15,136 INFO L158 Benchmark]: RCFGBuilder took 278.36ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 48.6MB in the end (delta: -17.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-11 23:46:15,137 INFO L158 Benchmark]: TraceAbstraction took 213956.66ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 48.1MB in the beginning and 67.1MB in the end (delta: -19.1MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2022-07-11 23:46:15,137 INFO L158 Benchmark]: Witness Printer took 86.65ms. Allocated memory is still 146.8MB. Free memory was 67.1MB in the beginning and 62.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:46:15,140 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.21ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.94ms. Allocated memory is still 54.5MB. Free memory was 31.9MB in the beginning and 33.7MB in the end (delta: -1.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.67ms. Allocated memory is still 54.5MB. Free memory was 33.7MB in the beginning and 32.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 54.5MB. Free memory was 32.3MB in the beginning and 31.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.36ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 48.6MB in the end (delta: -17.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * TraceAbstraction took 213956.66ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 48.1MB in the beginning and 67.1MB in the end (delta: -19.1MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Witness Printer took 86.65ms. Allocated memory is still 146.8MB. Free memory was 67.1MB in the beginning and 62.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<