./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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/recursive/Ackermann03.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 c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 07:58:31,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 07:58:31,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 07:58:31,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 07:58:31,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 07:58:31,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 07:58:31,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 07:58:31,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 07:58:31,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 07:58:31,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 07:58:31,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 07:58:31,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 07:58:31,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 07:58:31,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 07:58:31,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 07:58:31,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 07:58:31,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 07:58:31,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 07:58:31,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 07:58:31,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 07:58:31,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 07:58:31,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 07:58:31,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 07:58:31,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 07:58:31,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 07:58:31,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 07:58:31,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 07:58:31,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 07:58:31,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 07:58:31,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 07:58:31,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 07:58:31,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 07:58:31,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 07:58:31,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 07:58:31,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 07:58:31,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 07:58:31,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 07:58:31,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 07:58:31,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 07:58:31,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 07:58:31,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 07:58:31,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 07:58:31,916 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 07:58:31,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 07:58:31,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 07:58:31,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 07:58:31,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 07:58:31,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 07:58:31,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 07:58:31,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 07:58:31,918 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 07:58:31,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 07:58:31,918 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 07:58:31,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 07:58:31,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 07:58:31,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 07:58:31,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 07:58:31,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 07:58:31,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 07:58:31,919 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 07:58:31,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 07:58:31,919 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 07:58:31,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 07:58:31,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 07:58:31,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 07:58:31,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 07:58:31,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:58:31,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 07:58:31,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 07:58:31,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 07:58:31,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 07:58:31,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 07:58:31,921 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 07:58:31,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 07:58:31,921 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 07:58:31,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 07:58:31,921 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 07:58:31,921 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd [2023-02-17 07:58:32,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 07:58:32,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 07:58:32,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 07:58:32,144 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 07:58:32,144 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 07:58:32,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2023-02-17 07:58:33,315 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 07:58:33,491 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 07:58:33,491 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2023-02-17 07:58:33,495 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b503fdd89/54914d35130c481690fe09d5d17de810/FLAG39312c818 [2023-02-17 07:58:33,505 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b503fdd89/54914d35130c481690fe09d5d17de810 [2023-02-17 07:58:33,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 07:58:33,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 07:58:33,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 07:58:33,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 07:58:33,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 07:58:33,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb1dc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33, skipping insertion in model container [2023-02-17 07:58:33,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 07:58:33,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 07:58:33,643 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c[1168,1181] [2023-02-17 07:58:33,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:58:33,655 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 07:58:33,668 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c[1168,1181] [2023-02-17 07:58:33,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:58:33,680 INFO L208 MainTranslator]: Completed translation [2023-02-17 07:58:33,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33 WrapperNode [2023-02-17 07:58:33,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 07:58:33,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 07:58:33,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 07:58:33,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 07:58:33,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,700 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-02-17 07:58:33,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 07:58:33,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 07:58:33,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 07:58:33,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 07:58:33,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,723 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 07:58:33,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 07:58:33,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 07:58:33,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 07:58:33,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (1/1) ... [2023-02-17 07:58:33,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:58:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:33,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 07:58:33,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 07:58:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 07:58:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 07:58:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 07:58:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-02-17 07:58:33,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-02-17 07:58:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 07:58:33,835 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 07:58:33,836 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 07:58:33,927 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 07:58:33,934 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 07:58:33,944 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 07:58:33,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:58:33 BoogieIcfgContainer [2023-02-17 07:58:33,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 07:58:33,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 07:58:33,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 07:58:33,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 07:58:33,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 07:58:33" (1/3) ... [2023-02-17 07:58:33,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1403d781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:58:33, skipping insertion in model container [2023-02-17 07:58:33,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:33" (2/3) ... [2023-02-17 07:58:33,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1403d781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:58:33, skipping insertion in model container [2023-02-17 07:58:33,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:58:33" (3/3) ... [2023-02-17 07:58:33,951 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2023-02-17 07:58:33,961 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 07:58:33,965 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 07:58:34,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 07:58:34,011 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33ae2f90, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 07:58:34,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 07:58:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 07:58:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 07:58:34,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:34,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:34,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:34,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2023-02-17 07:58:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:34,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040670381] [2023-02-17 07:58:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 07:58:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:34,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040670381] [2023-02-17 07:58:34,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040670381] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:58:34,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:58:34,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:58:34,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438018691] [2023-02-17 07:58:34,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:58:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:58:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:34,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:58:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:58:34,248 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 07:58:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:34,308 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2023-02-17 07:58:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 07:58:34,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2023-02-17 07:58:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:34,315 INFO L225 Difference]: With dead ends: 51 [2023-02-17 07:58:34,315 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 07:58:34,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 07:58:34,319 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:34,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 07:58:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 07:58:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-17 07:58:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 07:58:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-02-17 07:58:34,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2023-02-17 07:58:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:34,344 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-02-17 07:58:34,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 07:58:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-02-17 07:58:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 07:58:34,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:34,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:34,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 07:58:34,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2023-02-17 07:58:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:34,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51255761] [2023-02-17 07:58:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:34,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:34,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 07:58:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:34,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51255761] [2023-02-17 07:58:34,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51255761] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:34,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391786682] [2023-02-17 07:58:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:34,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:34,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:34,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:34,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 07:58:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:34,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 07:58:34,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 07:58:34,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 07:58:34,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391786682] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:34,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:34,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-02-17 07:58:34,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512554076] [2023-02-17 07:58:34,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:34,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 07:58:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:34,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 07:58:34,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 07:58:34,712 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 07:58:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:34,840 INFO L93 Difference]: Finished difference Result 74 states and 126 transitions. [2023-02-17 07:58:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 07:58:34,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 19 [2023-02-17 07:58:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:34,842 INFO L225 Difference]: With dead ends: 74 [2023-02-17 07:58:34,843 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 07:58:34,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:58:34,845 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:34,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 91 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 07:58:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-17 07:58:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2023-02-17 07:58:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2023-02-17 07:58:34,857 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 19 [2023-02-17 07:58:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:34,857 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2023-02-17 07:58:34,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 07:58:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2023-02-17 07:58:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 07:58:34,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:34,860 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:34,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 07:58:35,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:35,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash -574784801, now seen corresponding path program 1 times [2023-02-17 07:58:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:35,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142378814] [2023-02-17 07:58:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:35,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:35,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:35,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:35,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-17 07:58:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:35,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142378814] [2023-02-17 07:58:35,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142378814] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:35,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279241081] [2023-02-17 07:58:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:35,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:35,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:35,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 07:58:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:35,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 07:58:35,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-17 07:58:35,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-17 07:58:35,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279241081] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:35,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:35,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2023-02-17 07:58:35,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018999009] [2023-02-17 07:58:35,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:35,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 07:58:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 07:58:35,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-17 07:58:35,743 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-17 07:58:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:35,825 INFO L93 Difference]: Finished difference Result 120 states and 227 transitions. [2023-02-17 07:58:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 07:58:35,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) Word has length 45 [2023-02-17 07:58:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:35,833 INFO L225 Difference]: With dead ends: 120 [2023-02-17 07:58:35,834 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 07:58:35,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 14 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:58:35,839 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:35,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 82 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 07:58:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-17 07:58:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2023-02-17 07:58:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2023-02-17 07:58:35,850 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 45 [2023-02-17 07:58:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:35,850 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2023-02-17 07:58:35,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-17 07:58:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2023-02-17 07:58:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-02-17 07:58:35,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:35,853 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:35,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 07:58:36,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-17 07:58:36,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:36,058 INFO L85 PathProgramCache]: Analyzing trace with hash -749766204, now seen corresponding path program 2 times [2023-02-17 07:58:36,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:36,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686562247] [2023-02-17 07:58:36,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:36,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-17 07:58:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-02-17 07:58:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:36,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686562247] [2023-02-17 07:58:36,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686562247] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:36,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837827116] [2023-02-17 07:58:36,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:58:36,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:36,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:36,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:36,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 07:58:36,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:58:36,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:36,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 07:58:36,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-02-17 07:58:36,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-02-17 07:58:36,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837827116] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:36,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:36,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2023-02-17 07:58:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266565707] [2023-02-17 07:58:36,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:36,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 07:58:36,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 07:58:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2023-02-17 07:58:36,999 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2023-02-17 07:58:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:37,232 INFO L93 Difference]: Finished difference Result 106 states and 183 transitions. [2023-02-17 07:58:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 07:58:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 79 [2023-02-17 07:58:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:37,234 INFO L225 Difference]: With dead ends: 106 [2023-02-17 07:58:37,234 INFO L226 Difference]: Without dead ends: 58 [2023-02-17 07:58:37,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 155 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=1342, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 07:58:37,235 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:37,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 183 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-17 07:58:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2023-02-17 07:58:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2023-02-17 07:58:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2023-02-17 07:58:37,242 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 79 [2023-02-17 07:58:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:37,242 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2023-02-17 07:58:37,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2023-02-17 07:58:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2023-02-17 07:58:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-02-17 07:58:37,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:37,247 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 17, 12, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:37,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:37,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:37,453 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1990672114, now seen corresponding path program 3 times [2023-02-17 07:58:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:37,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713113468] [2023-02-17 07:58:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 381 proven. 500 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2023-02-17 07:58:38,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:38,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713113468] [2023-02-17 07:58:38,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713113468] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:38,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71932154] [2023-02-17 07:58:38,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:58:38,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:38,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:38,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:38,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 07:58:38,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2023-02-17 07:58:38,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:38,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 07:58:38,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 365 proven. 88 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2023-02-17 07:58:38,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 365 proven. 106 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2023-02-17 07:58:38,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71932154] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:38,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:38,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 11] total 20 [2023-02-17 07:58:38,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120085756] [2023-02-17 07:58:38,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:38,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 07:58:38,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:38,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 07:58:38,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2023-02-17 07:58:38,481 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 10 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (28), 17 states have call predecessors, (28), 10 states have call successors, (28) [2023-02-17 07:58:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:38,638 INFO L93 Difference]: Finished difference Result 138 states and 256 transitions. [2023-02-17 07:58:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 07:58:38,639 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 10 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (28), 17 states have call predecessors, (28), 10 states have call successors, (28) Word has length 197 [2023-02-17 07:58:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:38,642 INFO L225 Difference]: With dead ends: 138 [2023-02-17 07:58:38,642 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 07:58:38,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 433 SyntacticMatches, 16 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2023-02-17 07:58:38,643 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:38,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 177 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 07:58:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-17 07:58:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2023-02-17 07:58:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-02-17 07:58:38,660 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 197 [2023-02-17 07:58:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:38,662 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-02-17 07:58:38,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 10 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (28), 17 states have call predecessors, (28), 10 states have call successors, (28) [2023-02-17 07:58:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-02-17 07:58:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-17 07:58:38,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:38,666 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:38,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:38,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:38,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1538229242, now seen corresponding path program 4 times [2023-02-17 07:58:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:38,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172100968] [2023-02-17 07:58:38,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-17 07:58:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 126 proven. 271 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2023-02-17 07:58:39,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:39,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172100968] [2023-02-17 07:58:39,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172100968] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:39,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543802866] [2023-02-17 07:58:39,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 07:58:39,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:39,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:39,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:39,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 07:58:39,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 07:58:39,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:39,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 07:58:39,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 484 proven. 71 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-02-17 07:58:39,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 131 proven. 269 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-17 07:58:39,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543802866] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:39,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:39,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2023-02-17 07:58:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450195542] [2023-02-17 07:58:39,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:39,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 07:58:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 07:58:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-02-17 07:58:39,739 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 21 states have internal predecessors, (68), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) [2023-02-17 07:58:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:39,954 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2023-02-17 07:58:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 07:58:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 21 states have internal predecessors, (68), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) Word has length 131 [2023-02-17 07:58:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:39,956 INFO L225 Difference]: With dead ends: 102 [2023-02-17 07:58:39,956 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 07:58:39,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 270 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 07:58:39,957 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:39,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 169 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 07:58:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-17 07:58:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2023-02-17 07:58:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2023-02-17 07:58:39,963 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 131 [2023-02-17 07:58:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:39,963 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2023-02-17 07:58:39,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 21 states have internal predecessors, (68), 11 states have call successors, (17), 2 states have call predecessors, (17), 12 states have return successors, (27), 13 states have call predecessors, (27), 11 states have call successors, (27) [2023-02-17 07:58:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2023-02-17 07:58:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-17 07:58:39,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:39,965 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:39,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:40,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:40,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1811622132, now seen corresponding path program 5 times [2023-02-17 07:58:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:40,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595327048] [2023-02-17 07:58:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-02-17 07:58:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 153 proven. 289 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2023-02-17 07:58:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595327048] [2023-02-17 07:58:40,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595327048] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665759070] [2023-02-17 07:58:40,561 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 07:58:40,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:40,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:40,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 07:58:40,659 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-17 07:58:40,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:40,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 07:58:40,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-02-17 07:58:40,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 155 proven. 295 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2023-02-17 07:58:40,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665759070] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:40,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:40,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2023-02-17 07:58:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829563817] [2023-02-17 07:58:40,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:40,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 07:58:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:40,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 07:58:40,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-02-17 07:58:40,946 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2023-02-17 07:58:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:41,162 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2023-02-17 07:58:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 07:58:41,163 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 131 [2023-02-17 07:58:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:41,163 INFO L225 Difference]: With dead ends: 116 [2023-02-17 07:58:41,164 INFO L226 Difference]: Without dead ends: 74 [2023-02-17 07:58:41,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 267 SyntacticMatches, 27 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=433, Invalid=1459, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 07:58:41,165 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:41,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 158 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-17 07:58:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2023-02-17 07:58:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2023-02-17 07:58:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2023-02-17 07:58:41,170 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 131 [2023-02-17 07:58:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:41,170 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2023-02-17 07:58:41,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2023-02-17 07:58:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2023-02-17 07:58:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-02-17 07:58:41,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:41,172 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:41,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:41,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:41,378 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:41,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1701842998, now seen corresponding path program 6 times [2023-02-17 07:58:41,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:41,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876873185] [2023-02-17 07:58:41,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:41,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 446 proven. 274 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2023-02-17 07:58:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876873185] [2023-02-17 07:58:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876873185] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489297446] [2023-02-17 07:58:42,098 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 07:58:42,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:42,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:42,122 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:42,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 07:58:42,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2023-02-17 07:58:42,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:42,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 07:58:42,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2023-02-17 07:58:42,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2023-02-17 07:58:42,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489297446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:42,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:42,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 27] total 37 [2023-02-17 07:58:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245544546] [2023-02-17 07:58:42,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:42,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-17 07:58:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:42,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-17 07:58:42,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 07:58:42,946 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2023-02-17 07:58:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:43,390 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2023-02-17 07:58:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-17 07:58:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) Word has length 157 [2023-02-17 07:58:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:43,391 INFO L225 Difference]: With dead ends: 128 [2023-02-17 07:58:43,392 INFO L226 Difference]: Without dead ends: 84 [2023-02-17 07:58:43,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 308 SyntacticMatches, 40 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=763, Invalid=3269, Unknown=0, NotChecked=0, Total=4032 [2023-02-17 07:58:43,393 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:43,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 270 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:58:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-17 07:58:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2023-02-17 07:58:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2023-02-17 07:58:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2023-02-17 07:58:43,401 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 157 [2023-02-17 07:58:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:43,402 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2023-02-17 07:58:43,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2023-02-17 07:58:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2023-02-17 07:58:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-02-17 07:58:43,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:43,404 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:43,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:43,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:43,611 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:43,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash -860565711, now seen corresponding path program 7 times [2023-02-17 07:58:43,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:43,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90150650] [2023-02-17 07:58:43,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:43,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2023-02-17 07:58:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:44,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90150650] [2023-02-17 07:58:44,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90150650] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:44,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469257138] [2023-02-17 07:58:44,376 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 07:58:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:44,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:44,378 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:44,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 07:58:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-17 07:58:44,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-02-17 07:58:44,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2023-02-17 07:58:45,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469257138] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:45,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:45,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 34 [2023-02-17 07:58:45,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488788493] [2023-02-17 07:58:45,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:45,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 07:58:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:45,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 07:58:45,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 07:58:45,200 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2023-02-17 07:58:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:45,695 INFO L93 Difference]: Finished difference Result 143 states and 183 transitions. [2023-02-17 07:58:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-17 07:58:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 170 [2023-02-17 07:58:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:45,697 INFO L225 Difference]: With dead ends: 143 [2023-02-17 07:58:45,697 INFO L226 Difference]: Without dead ends: 94 [2023-02-17 07:58:45,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 335 SyntacticMatches, 47 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=826, Invalid=3206, Unknown=0, NotChecked=0, Total=4032 [2023-02-17 07:58:45,698 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:45,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 231 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 07:58:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-17 07:58:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2023-02-17 07:58:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (27), 17 states have call predecessors, (27), 14 states have call successors, (27) [2023-02-17 07:58:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2023-02-17 07:58:45,708 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 170 [2023-02-17 07:58:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:45,709 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2023-02-17 07:58:45,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2023-02-17 07:58:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2023-02-17 07:58:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-17 07:58:45,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:45,711 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:45,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:45,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-17 07:58:45,917 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 332854534, now seen corresponding path program 8 times [2023-02-17 07:58:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:45,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144966780] [2023-02-17 07:58:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-17 07:58:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2023-02-17 07:58:46,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:46,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144966780] [2023-02-17 07:58:46,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144966780] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:46,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550651078] [2023-02-17 07:58:46,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:58:46,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:46,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:46,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:46,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 07:58:47,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:58:47,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:47,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-17 07:58:47,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2023-02-17 07:58:47,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 597 proven. 189 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2023-02-17 07:58:47,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550651078] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:47,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:47,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 36 [2023-02-17 07:58:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676264137] [2023-02-17 07:58:47,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:47,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 07:58:47,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:47,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 07:58:47,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 07:58:47,894 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-17 07:58:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:49,059 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2023-02-17 07:58:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-17 07:58:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) Word has length 183 [2023-02-17 07:58:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:49,060 INFO L225 Difference]: With dead ends: 126 [2023-02-17 07:58:49,060 INFO L226 Difference]: Without dead ends: 122 [2023-02-17 07:58:49,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 371 SyntacticMatches, 42 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=568, Invalid=4402, Unknown=0, NotChecked=0, Total=4970 [2023-02-17 07:58:49,063 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 186 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:49,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 484 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 07:58:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-17 07:58:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2023-02-17 07:58:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 63 states have internal predecessors, (69), 17 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (38), 21 states have call predecessors, (38), 17 states have call successors, (38) [2023-02-17 07:58:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2023-02-17 07:58:49,070 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 183 [2023-02-17 07:58:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:49,070 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2023-02-17 07:58:49,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-17 07:58:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2023-02-17 07:58:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-02-17 07:58:49,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:49,072 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:49,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:49,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 07:58:49,278 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:49,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash 530318069, now seen corresponding path program 9 times [2023-02-17 07:58:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:49,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965655994] [2023-02-17 07:58:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-17 07:58:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-02-17 07:58:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2023-02-17 07:58:50,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:50,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965655994] [2023-02-17 07:58:50,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965655994] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:50,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74273893] [2023-02-17 07:58:50,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:58:50,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:50,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:50,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:50,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 07:58:50,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2023-02-17 07:58:50,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:50,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-17 07:58:50,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2023-02-17 07:58:50,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 685 proven. 580 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2023-02-17 07:58:51,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74273893] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:51,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:51,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 32] total 38 [2023-02-17 07:58:51,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506612615] [2023-02-17 07:58:51,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:51,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-17 07:58:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-17 07:58:51,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 07:58:51,449 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2023-02-17 07:58:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:51,939 INFO L93 Difference]: Finished difference Result 207 states and 270 transitions. [2023-02-17 07:58:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 07:58:51,939 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) Word has length 196 [2023-02-17 07:58:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:51,951 INFO L225 Difference]: With dead ends: 207 [2023-02-17 07:58:51,952 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 07:58:51,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 389 SyntacticMatches, 51 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=759, Invalid=3147, Unknown=0, NotChecked=0, Total=3906 [2023-02-17 07:58:51,954 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 108 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:51,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 299 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 07:58:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 07:58:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2023-02-17 07:58:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 66 states have internal predecessors, (71), 18 states have call successors, (18), 8 states have call predecessors, (18), 14 states have return successors, (40), 23 states have call predecessors, (40), 18 states have call successors, (40) [2023-02-17 07:58:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2023-02-17 07:58:51,979 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 196 [2023-02-17 07:58:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:51,981 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2023-02-17 07:58:51,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2023-02-17 07:58:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2023-02-17 07:58:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-17 07:58:51,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:51,986 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:51,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:52,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-17 07:58:52,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash 660925528, now seen corresponding path program 10 times [2023-02-17 07:58:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:52,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667788175] [2023-02-17 07:58:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-02-17 07:58:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-17 07:58:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-02-17 07:58:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 268 proven. 783 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2023-02-17 07:58:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:52,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667788175] [2023-02-17 07:58:52,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667788175] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:52,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013400751] [2023-02-17 07:58:52,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 07:58:52,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:52,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:52,776 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:52,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 07:58:53,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 07:58:53,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:53,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 07:58:53,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2023-02-17 07:58:53,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 274 proven. 806 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2023-02-17 07:58:53,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013400751] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:53,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:53,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 27 [2023-02-17 07:58:53,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723842114] [2023-02-17 07:58:53,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:53,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 07:58:53,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:53,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 07:58:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-02-17 07:58:53,492 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2023-02-17 07:58:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:53,744 INFO L93 Difference]: Finished difference Result 175 states and 227 transitions. [2023-02-17 07:58:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 07:58:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) Word has length 209 [2023-02-17 07:58:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:53,745 INFO L225 Difference]: With dead ends: 175 [2023-02-17 07:58:53,745 INFO L226 Difference]: Without dead ends: 104 [2023-02-17 07:58:53,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 441 SyntacticMatches, 31 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 07:58:53,747 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 81 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:53,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 254 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:58:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-17 07:58:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2023-02-17 07:58:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.096774193548387) internal successors, (68), 63 states have internal predecessors, (68), 17 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (31), 21 states have call predecessors, (31), 17 states have call successors, (31) [2023-02-17 07:58:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2023-02-17 07:58:53,752 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 209 [2023-02-17 07:58:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:53,752 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2023-02-17 07:58:53,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2023-02-17 07:58:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2023-02-17 07:58:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2023-02-17 07:58:53,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:53,754 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:53,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:53,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-17 07:58:53,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash 471385981, now seen corresponding path program 11 times [2023-02-17 07:58:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:53,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399686003] [2023-02-17 07:58:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-17 07:58:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-02-17 07:58:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-17 07:58:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-02-17 07:58:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 228 proven. 513 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2023-02-17 07:58:54,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:54,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399686003] [2023-02-17 07:58:54,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399686003] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:54,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927374474] [2023-02-17 07:58:54,485 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 07:58:54,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:54,487 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:58:54,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-17 07:58:54,900 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-02-17 07:58:54,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:54,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-17 07:58:54,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1483 proven. 777 refuted. 0 times theorem prover too weak. 2069 trivial. 0 not checked. [2023-02-17 07:58:55,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1579 proven. 819 refuted. 0 times theorem prover too weak. 1931 trivial. 0 not checked. [2023-02-17 07:58:56,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927374474] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:56,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:56,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 29, 40] total 48 [2023-02-17 07:58:56,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297124191] [2023-02-17 07:58:56,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:56,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-17 07:58:56,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:56,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-17 07:58:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1988, Unknown=0, NotChecked=0, Total=2256 [2023-02-17 07:58:56,520 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 42 states have internal predecessors, (112), 26 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (51), 26 states have call predecessors, (51), 26 states have call successors, (51) [2023-02-17 07:58:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:57,336 INFO L93 Difference]: Finished difference Result 196 states and 274 transitions. [2023-02-17 07:58:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-02-17 07:58:57,337 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 42 states have internal predecessors, (112), 26 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (51), 26 states have call predecessors, (51), 26 states have call successors, (51) Word has length 281 [2023-02-17 07:58:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:57,337 INFO L225 Difference]: With dead ends: 196 [2023-02-17 07:58:57,337 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 07:58:57,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 557 SyntacticMatches, 48 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1647, Invalid=7095, Unknown=0, NotChecked=0, Total=8742 [2023-02-17 07:58:57,340 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 109 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:57,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 399 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 07:58:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 07:58:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 07:58:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 07:58:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 07:58:57,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2023-02-17 07:58:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:57,340 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 07:58:57,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.3333333333333335) internal successors, (112), 42 states have internal predecessors, (112), 26 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (51), 26 states have call predecessors, (51), 26 states have call successors, (51) [2023-02-17 07:58:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 07:58:57,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 07:58:57,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 07:58:57,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:57,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-17 07:58:57,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 07:58:57,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 07:58:57,584 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 07:58:57,584 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2023-02-17 07:58:57,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 07:58:57,584 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 47) the Hoare annotation is: true [2023-02-17 07:58:57,585 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2023-02-17 07:58:57,585 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-17 07:58:57,585 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-02-17 07:58:57,585 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 07:58:57,585 INFO L902 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2023-02-17 07:58:57,585 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2023-02-17 07:58:57,585 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2023-02-17 07:58:57,585 INFO L899 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2023-02-17 07:58:57,587 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (let ((.cse73 (= 1 |ackermann_#in~n|)) (.cse44 (<= 0 (+ |ackermann_#res| (- 2))))) (let ((.cse43 (<= |ackermann_#res| 2)) (.cse70 (<= |ackermann_#res| 5)) (.cse71 (<= 0 (+ |ackermann_#res| (- 5)))) (.cse57 (<= |ackermann_#res| 4)) (.cse58 (<= 0 (+ |ackermann_#res| (- 4)))) (.cse17 (<= |ackermann_#in~m| 0)) (.cse56 (<= 0 (+ |ackermann_#in~n| (- 6)))) (.cse55 (<= |ackermann_#in~n| 6)) (.cse54 (<= 0 (+ |ackermann_#res| (- 7)))) (.cse53 (<= |ackermann_#res| 7)) (.cse72 (not .cse44)) (.cse67 (<= 0 (+ |ackermann_#res| (- 6)))) (.cse66 (<= |ackermann_#res| 6)) (.cse65 (<= 0 (+ |ackermann_#in~n| (- 5)))) (.cse64 (<= |ackermann_#in~n| 5)) (.cse60 (<= |ackermann_#in~n| 3)) (.cse59 (<= 0 (+ |ackermann_#in~n| (- 3)))) (.cse68 (<= 0 (+ |ackermann_#in~n| (- 4)))) (.cse69 (<= |ackermann_#in~n| 4)) (.cse74 (+ 1 ackermann_~n)) (.cse61 (<= |ackermann_#in~n| 2)) (.cse63 (<= 0 (+ |ackermann_#res| (- 3)))) (.cse62 (<= |ackermann_#res| 3)) (.cse49 (<= 0 (+ |ackermann_#in~n| (- 2)))) (.cse42 (not .cse73))) (let ((.cse50 (<= |ackermann_#in~n| 1)) (.cse6 (<= 0 (+ |ackermann_#in~n| (- 1)))) (.cse7 (<= |ackermann_#in~m| 1)) (.cse40 (or .cse42 .cse44)) (.cse45 (<= (* (- 1) |ackermann_#in~n|) (- 3))) (.cse47 (not .cse49)) (.cse18 (<= |ackermann_#in~n| 0)) (.cse19 (<= ackermann_~m 1)) (.cse23 (and .cse49 .cse61 (or (not .cse63) (not .cse62)))) (.cse27 (and .cse49 (or (not (<= 0 (+ .cse74 (- 3)))) (not (<= .cse74 3))) .cse61)) (.cse52 (not (= |ackermann_#in~m| 0))) (.cse21 (and .cse68 (or (not (<= 0 (+ .cse74 (- 5)))) (not (<= .cse74 5))) .cse69)) (.cse22 (and (or (not (<= .cse74 4)) (not (<= 0 (+ .cse74 (- 4))))) .cse60 .cse59)) (.cse32 (and .cse65 (or (not (<= .cse74 6)) (not (<= 0 (+ .cse74 (- 6))))) .cse64)) (.cse33 (and .cse65 (or (not .cse67) (not .cse66)) .cse64)) (.cse24 (and .cse72 .cse73)) (.cse25 (and (or (not (<= 0 (+ .cse74 (- 2)))) (not (<= .cse74 2))) .cse73)) (.cse26 (and .cse56 .cse55 (or (not .cse54) (not .cse53)))) (.cse14 (not .cse17)) (.cse28 (and .cse56 .cse55 (or (not (<= 0 (+ .cse74 (- 7)))) (not (<= .cse74 7))))) (.cse29 (and .cse60 .cse59 (or (not .cse57) (not .cse58)))) (.cse30 (and .cse68 (or (not .cse70) (not .cse71)) .cse69)) (.cse31 (and (or .cse72 (not .cse43)) .cse73)) (.cse16 (= ackermann_~m |ackermann_#in~m|)) (.cse48 (< |ackermann_#in~n| 2)) (.cse9 (= |ackermann_#in~m| ackermann_~m)) (.cse10 (<= 0 (+ ackermann_~m (- 1)))) (.cse11 (= |ackermann_#in~n| ackermann_~n)) (.cse20 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse13 (and .cse16 .cse48 .cse9 .cse10 .cse11 .cse20)) (.cse46 (and (or .cse52 .cse21 .cse23 .cse32 .cse33 .cse24 .cse25 .cse26 .cse14 .cse27 .cse28 .cse30 .cse31) (or .cse52 .cse22 .cse23 .cse32 .cse33 .cse24 .cse25 .cse26 .cse14 .cse27 .cse28 .cse29 .cse31) (or .cse52 .cse24 .cse14) (or .cse52 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse14 .cse27 .cse28 .cse29 .cse30 .cse31) (or .cse52 .cse21 .cse22 .cse23 .cse32 .cse33 .cse24 .cse25 .cse14 .cse27 .cse29 .cse30 .cse31) (or .cse52 .cse21 .cse22 .cse32 .cse33 .cse24 .cse25 .cse26 .cse14 .cse28 .cse29 .cse30 .cse31))) (.cse15 (and .cse16 .cse17 .cse9 .cse19 .cse20)) (.cse0 (not .cse18)) (.cse1 (and .cse16 .cse18 .cse9 .cse20)) (.cse35 (or (not .cse68) (not .cse69) (and .cse70 .cse71))) (.cse41 (or (not .cse64) (not .cse65) (and .cse66 .cse67))) (.cse37 (or .cse47 (not .cse61) (and .cse62 .cse63))) (.cse38 (or (and .cse57 .cse58) (not .cse59) (not .cse60))) (.cse39 (or (and .cse53 .cse54) (not .cse55) (not .cse56))) (.cse34 (not .cse45)) (.cse5 (<= ackermann_~m 2)) (.cse8 (or (and .cse16 .cse9 .cse11 .cse20 .cse40) (and .cse16 .cse9 .cse11 .cse20))) (.cse3 (not .cse7)) (.cse4 (not (<= 0 (+ |ackermann_#in~m| (- 1))))) (.cse12 (not .cse48)) (.cse2 (not .cse6)) (.cse51 (not .cse50))) (and (or (not (= |ackermann_#in~n| 0)) .cse0 (not (<= 0 |ackermann_#in~n|)) .cse1) (or .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (or .cse12 .cse13 .cse4) (or (and .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) .cse3 .cse4) (or .cse14 .cse15) .cse8 (or .cse0 .cse14 (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20)) .cse9 (or (and (or .cse21 .cse22 .cse23 .cse3 .cse24 .cse25 .cse26 .cse27 .cse28 .cse4 .cse29 .cse30 .cse31) (or .cse21 .cse22 .cse23 .cse32 .cse3 .cse33 .cse24 .cse25 .cse27 .cse4 .cse29 .cse30 .cse31)) .cse34 (and (let ((.cse36 (or .cse42 (and .cse43 .cse44)))) (or (and .cse5 .cse7 .cse35 .cse36 .cse37 .cse8 .cse9 .cse38 .cse10 .cse11 .cse39 .cse40) (and .cse5 .cse7 .cse35 .cse36 .cse41 .cse37 .cse8 .cse9 .cse38 .cse10 .cse11 .cse40))) .cse11 .cse45)) (or (and .cse8 .cse9 (<= 0 (+ ackermann_~m (- 2)))) (not (<= 0 (+ |ackermann_#in~m| (- 2))))) (or .cse0 .cse4 .cse1) (or .cse46 .cse34 .cse15) (or .cse12 (not (<= 0 |ackermann_#in~m|)) .cse13) (or .cse46 .cse47 .cse15) (or .cse0 .cse1) (or .cse12 .cse14 (and .cse16 .cse17 .cse48 .cse9 .cse19 .cse20)) (or (and .cse49 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) .cse47 .cse3 .cse4) (or .cse21 .cse22 (and .cse50 .cse6 .cse16 .cse35 .cse41 .cse37 .cse48 .cse9 .cse38 .cse11 .cse39 .cse20) .cse23 .cse32 .cse33 .cse12 .cse26 .cse2 .cse27 .cse28 .cse29 .cse51 .cse30) (or .cse24 (and .cse49 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse40) .cse47 .cse3 .cse4) (or .cse24 .cse34 (and .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse45 .cse40) .cse3 .cse4) (or .cse52 .cse21 .cse22 .cse23 .cse32 .cse33 .cse12 .cse26 .cse2 .cse27 .cse28 .cse29 .cse51 .cse30) .cse11))))) [2023-02-17 07:58:57,587 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2023-02-17 07:58:57,588 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (let ((.cse69 (<= 0 (+ |ackermann_#in~n| (- 2)))) (.cse73 (<= 0 (+ |ackermann_#res| (- 2))))) (let ((.cse45 (<= |ackermann_#in~m| 0)) (.cse49 (not .cse73)) (.cse62 (+ 1 ackermann_~n)) (.cse52 (<= 0 (+ |ackermann_#in~n| (- 4)))) (.cse55 (<= |ackermann_#in~n| 4)) (.cse53 (<= |ackermann_#res| 5)) (.cse54 (<= 0 (+ |ackermann_#res| (- 5)))) (.cse64 (<= |ackermann_#res| 7)) (.cse63 (<= 0 (+ |ackermann_#res| (- 7)))) (.cse61 (<= |ackermann_#in~n| 6)) (.cse60 (<= 0 (+ |ackermann_#in~n| (- 6)))) (.cse58 (<= |ackermann_#res| 4)) (.cse59 (<= 0 (+ |ackermann_#res| (- 4)))) (.cse57 (<= 0 (+ |ackermann_#in~n| (- 3)))) (.cse56 (<= |ackermann_#in~n| 3)) (.cse13 (not .cse69)) (.cse70 (<= |ackermann_#in~n| 2)) (.cse72 (<= |ackermann_#res| 3)) (.cse71 (<= 0 (+ |ackermann_#res| (- 3)))) (.cse68 (<= |ackermann_#in~n| 5)) (.cse65 (<= 0 (+ |ackermann_#in~n| (- 5)))) (.cse67 (<= |ackermann_#res| 6)) (.cse66 (<= 0 (+ |ackermann_#res| (- 6)))) (.cse51 (= 1 |ackermann_#in~n|)) (.cse50 (<= |ackermann_#res| 2))) (let ((.cse46 (<= |ackermann_#in~m| 1)) (.cse40 (or (not .cse51) (and .cse50 .cse73))) (.cse16 (or (not .cse68) (not .cse65) (and .cse67 .cse66))) (.cse41 (or .cse13 (not .cse70) (and .cse72 .cse71))) (.cse42 (or (and .cse58 .cse59) (not .cse57) (not .cse56))) (.cse43 (or (and .cse64 .cse63) (not .cse61) (not .cse60))) (.cse47 (<= ackermann_~m 2)) (.cse44 (or (not .cse52) (not .cse55) (and .cse53 .cse54))) (.cse30 (= |ackermann_#in~n| 0)) (.cse31 (= ackermann_~m |ackermann_#in~m|)) (.cse17 (= |ackermann_#in~m| ackermann_~m)) (.cse48 (<= 0 (+ ackermann_~m (- 1)))) (.cse38 (= |ackermann_#in~n| ackermann_~n)) (.cse39 (= ackermann_~n |ackermann_#in~n|)) (.cse20 (and .cse69 .cse70 (or (not .cse71) (not .cse72)))) (.cse23 (and .cse69 (or (not (<= 0 (+ .cse62 (- 3)))) (not (<= .cse62 3))) .cse70)) (.cse34 (not (= |ackermann_#in~m| 0))) (.cse18 (and .cse52 (or (not (<= 0 (+ .cse62 (- 5)))) (not (<= .cse62 5))) .cse55)) (.cse19 (and (or (not (<= .cse62 4)) (not (<= 0 (+ .cse62 (- 4))))) .cse56 .cse57)) (.cse28 (and .cse65 (or (not (<= .cse62 6)) (not (<= 0 (+ .cse62 (- 6))))) .cse68)) (.cse29 (and .cse65 (or (not .cse66) (not .cse67)) .cse68)) (.cse2 (and .cse49 .cse51)) (.cse21 (and (or (not (<= 0 (+ .cse62 (- 2)))) (not (<= .cse62 2))) .cse51)) (.cse22 (and .cse60 .cse61 (or (not .cse63) (not .cse64)))) (.cse15 (not .cse45)) (.cse24 (and .cse60 .cse61 (or (not (<= 0 (+ .cse62 (- 7)))) (not (<= .cse62 7))))) (.cse25 (and .cse56 .cse57 (or (not .cse58) (not .cse59)))) (.cse26 (and .cse52 (or (not .cse53) (not .cse54)) .cse55)) (.cse27 (and (or .cse49 (not .cse50)) .cse51))) (let ((.cse11 (and (or .cse34 .cse18 .cse20 .cse28 .cse29 .cse2 .cse21 .cse22 .cse15 .cse23 .cse24 .cse26 .cse27) (or .cse34 .cse19 .cse20 .cse28 .cse29 .cse2 .cse21 .cse22 .cse15 .cse23 .cse24 .cse25 .cse27) (or .cse34 .cse2 .cse15) (or .cse34 .cse18 .cse19 .cse20 .cse2 .cse21 .cse22 .cse15 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse34 .cse18 .cse19 .cse20 .cse28 .cse29 .cse2 .cse21 .cse15 .cse23 .cse25 .cse26 .cse27) (or .cse34 .cse18 .cse19 .cse28 .cse29 .cse2 .cse21 .cse22 .cse15 .cse24 .cse25 .cse26 .cse27))) (.cse3 (not (<= (* (- 1) |ackermann_#in~n|) (- 3)))) (.cse7 (and .cse30 .cse31 .cse17 .cse48 .cse38 .cse39)) (.cse0 (and .cse46 .cse40 .cse16 .cse41 .cse17 .cse42 .cse48 .cse43 .cse47 .cse30 .cse31 .cse44 .cse38 .cse39)) (.cse1 (and .cse47 .cse30 .cse31 .cse46 .cse17 .cse48 .cse38 .cse39)) (.cse5 (not .cse46)) (.cse6 (not (<= 0 (+ |ackermann_#in~m| (- 1))))) (.cse32 (not (<= 0 (+ |ackermann_#in~m| (- 2))))) (.cse33 (and .cse30 .cse31 .cse17 .cse38 (<= 0 (+ ackermann_~m (- 2))) .cse39)) (.cse8 (not (< |ackermann_#in~n| 2))) (.cse35 (not (<= 0 (+ |ackermann_#in~n| (- 1))))) (.cse36 (not (<= |ackermann_#in~n| 1))) (.cse14 (not (<= |ackermann_#in~n| 0))) (.cse9 (and .cse30 .cse31 .cse39)) (.cse10 (and .cse30 .cse31 .cse17 .cse39)) (.cse4 (and .cse30 .cse31 .cse17 .cse38 .cse39)) (.cse37 (and .cse30 .cse31 .cse44 .cse40 .cse16 .cse41 .cse17 .cse42 .cse38 .cse43 .cse39)) (.cse12 (and .cse30 .cse31 .cse45 .cse17 (<= ackermann_~m 1) .cse39))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 (not (<= 0 |ackermann_#in~m|)) .cse9 .cse10 .cse4) (or .cse11 .cse3 .cse12) (or .cse0 .cse1 .cse13 .cse5 .cse6) (or .cse11 .cse13 .cse12) (or .cse14 .cse15 .cse9 .cse12) .cse16 (or .cse0 .cse5 .cse6) (or .cse8 .cse15 .cse9 .cse12) .cse17 (or (and (or .cse18 .cse19 .cse20 .cse5 .cse2 .cse21 .cse22 .cse23 .cse24 .cse6 .cse25 .cse26 .cse27) (or .cse18 .cse19 .cse20 .cse28 .cse5 .cse29 .cse2 .cse21 .cse23 .cse6 .cse25 .cse26 .cse27)) .cse0 .cse1 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6) .cse30 (or .cse14 .cse15 .cse12) .cse31 (or .cse32 .cse33) (or .cse7 .cse14 .cse6) (or .cse34 .cse18 .cse19 .cse20 .cse28 .cse4 .cse29 .cse8 .cse22 .cse35 .cse23 .cse9 .cse10 .cse24 .cse25 .cse36 .cse26) (or (not .cse30) .cse14 (not (<= 0 |ackermann_#in~n|)) .cse37) (or .cse7 .cse8 .cse9 .cse10 .cse4 .cse6) .cse38 .cse39 (or .cse35 .cse5 .cse6) .cse40 .cse41 (or .cse0 .cse1 .cse35 .cse5 .cse6) .cse42 .cse43 (or .cse32 .cse33 .cse4) .cse44 (or .cse18 .cse19 .cse20 .cse28 .cse4 .cse37 .cse29 .cse8 .cse22 .cse35 .cse9 .cse10 .cse23 .cse24 .cse25 .cse36 .cse26) (or .cse14 .cse9 .cse10) (or .cse9 .cse10 .cse4 .cse37) (or .cse15 .cse12)))))) [2023-02-17 07:58:57,590 INFO L895 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse36 (<= ackermann_~m 2)) (.cse38 (= ackermann_~m |ackermann_#in~m|)) (.cse41 (= |ackermann_#in~m| ackermann_~m)) (.cse42 (<= 0 (+ |ackermann_#t~ret5| (- 3)))) (.cse44 (= |ackermann_#in~n| ackermann_~n)) (.cse67 (<= 0 (+ ackermann_~m (- 2)))) (.cse46 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse98 (<= |ackermann_#in~n| 4)) (.cse94 (<= |ackermann_#in~n| 3)) (.cse37 (<= 0 (+ |ackermann_#t~ret5| (- 5)))) (.cse77 (<= |ackermann_#in~n| 2)) (.cse80 (and .cse36 .cse38 .cse41 .cse42 .cse44 .cse67 .cse46))) (let ((.cse88 (<= |ackermann_#t~ret5| 6)) (.cse91 (<= 0 (+ |ackermann_#t~ret5| (- 6)))) (.cse64 (<= |ackermann_#t~ret5| 5)) (.cse102 (let ((.cse107 (let ((.cse108 (or (and .cse36 .cse38 .cse41 .cse42 .cse77 .cse44 .cse67 .cse46) .cse80))) (or (and .cse108 .cse37 .cse77 .cse44) (and .cse108 .cse37 .cse94 .cse44) (and .cse108 .cse37 .cse44))))) (or (and .cse37 .cse107 .cse77 .cse44) (and .cse37 .cse107 .cse44 .cse98) (and .cse37 .cse107 .cse94 .cse44) (and .cse37 .cse107 .cse44)))) (.cse40 (<= 0 (+ |ackermann_#in~n| (- 6)))) (.cse93 (<= |ackermann_#in~n| 6)) (.cse104 (not (<= 0 (+ |ackermann_#res| (- 2))))) (.cse105 (= 1 |ackermann_#in~n|)) (.cse87 (<= 0 (+ |ackermann_#in~n| (- 5)))) (.cse90 (<= |ackermann_#in~n| 5)) (.cse95 (<= 0 (+ |ackermann_#in~n| (- 3)))) (.cse89 (<= 0 (+ |ackermann_#in~n| (- 4)))) (.cse82 (= |ackermann_#in~m| 0)) (.cse106 (+ 1 ackermann_~n)) (.cse63 (<= 0 (+ |ackermann_#in~n| (- 2))))) (let ((.cse17 (and .cse63 .cse77 (or (not (<= 0 (+ |ackermann_#res| (- 3)))) (not (<= |ackermann_#res| 3))))) (.cse23 (and .cse63 (or (not (<= 0 (+ .cse106 (- 3)))) (not (<= .cse106 3))) .cse77)) (.cse14 (not .cse82)) (.cse15 (and .cse89 (or (not (<= 0 (+ .cse106 (- 5)))) (not (<= .cse106 5))) .cse98)) (.cse16 (and (or (not (<= .cse106 4)) (not (<= 0 (+ .cse106 (- 4))))) .cse94 .cse95)) (.cse18 (and .cse87 (or (not (<= .cse106 6)) (not (<= 0 (+ .cse106 (- 6))))) .cse90)) (.cse19 (and .cse87 (or (not (<= 0 (+ |ackermann_#res| (- 6)))) (not (<= |ackermann_#res| 6))) .cse90)) (.cse30 (and .cse104 .cse105)) (.cse31 (and (or (not (<= 0 (+ .cse106 (- 2)))) (not (<= .cse106 2))) .cse105)) (.cse21 (and .cse40 .cse93 (or (not (<= 0 (+ |ackermann_#res| (- 7)))) (not (<= |ackermann_#res| 7))))) (.cse72 (not (<= |ackermann_#in~m| 0))) (.cse24 (and .cse40 .cse93 (or (not (<= 0 (+ .cse106 (- 7)))) (not (<= .cse106 7))))) (.cse26 (and .cse94 .cse95 (or (not (<= |ackermann_#res| 4)) (not (<= 0 (+ |ackermann_#res| (- 4))))))) (.cse28 (and .cse89 (or (not (<= |ackermann_#res| 5)) (not (<= 0 (+ |ackermann_#res| (- 5))))) .cse98)) (.cse33 (and (or .cse104 (not (<= |ackermann_#res| 2))) .cse105)) (.cse96 (<= |ackermann_#t~ret5| 4)) (.cse97 (<= 0 (+ |ackermann_#t~ret5| (- 4)))) (.cse99 (<= |ackermann_#in~n| 0)) (.cse85 (<= 3 |ackermann_#in~m|)) (.cse83 (<= |ackermann_#t~ret5| 2)) (.cse66 (<= |ackermann_#in~n| 1)) (.cse70 (<= 0 (+ |ackermann_#in~n| (- 1)))) (.cse71 (<= |ackermann_#t~ret5| 3)) (.cse69 (<= 0 (+ |ackermann_#t~ret5| (- 2)))) (.cse61 (< |ackermann_#in~n| 2)) (.cse84 (<= 2 |ackermann_#t~ret5|)) (.cse39 (<= |ackermann_#in~m| 1)) (.cse43 (<= 0 (+ ackermann_~m (- 1)))) (.cse45 (<= ackermann_~m 1)) (.cse92 (<= 7 |ackermann_#t~ret5|)) (.cse101 (let ((.cse103 (or (and .cse102 .cse95 .cse44) (and .cse87 .cse102 .cse44) (and .cse63 .cse102 .cse44) (and .cse102 .cse89 .cse44) (and .cse102 .cse40 .cse44)))) (or (and .cse89 .cse103 .cse44) (and .cse95 .cse103 .cse44)))) (.cse86 (<= (* (- 1) |ackermann_#in~n|) (- 3))) (.cse100 (<= 5 |ackermann_#t~ret5|)) (.cse65 (or (and .cse88 .cse102 .cse91 .cse44) (and .cse37 .cse102 .cse64 .cse44)))) (let ((.cse5 (and .cse63 .cse100 .cse64 .cse77 .cse44 .cse65)) (.cse9 (and .cse94 .cse92 .cse101 .cse44 .cse86)) (.cse12 (and .cse36 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)) (.cse4 (and .cse92 .cse101 .cse44 .cse86)) (.cse13 (and .cse92 .cse93 .cse101 .cse44 .cse86)) (.cse3 (and .cse66 .cse70 .cse71 .cse41 .cse69 .cse42 .cse36 .cse38 .cse61 .cse84 .cse44 .cse67 .cse46)) (.cse8 (and .cse92 .cse90 .cse101 .cse44 .cse86)) (.cse10 (and .cse92 .cse101 .cse44 .cse98 .cse86)) (.cse62 (and .cse38 .cse82 .cse46)) (.cse68 (and .cse38 .cse82)) (.cse54 (and .cse39 .cse64 .cse41 .cse42 .cse43 .cse86 .cse45 .cse36 .cse37 .cse38 .cse89 .cse100 .cse44 .cse98 .cse46)) (.cse74 (and .cse36 .cse66 .cse38 .cse39 .cse83 .cse61 .cse41 .cse69 .cse43 .cse44 .cse45 .cse46)) (.cse57 (and .cse71 .cse39 .cse41 .cse42 .cse43 .cse45 .cse63 .cse36 .cse38 .cse77 .cse44 (<= 3 |ackermann_#t~ret5|) .cse46)) (.cse75 (and .cse66 .cse70 .cse39 .cse83 .cse41 .cse69 .cse43 .cse45 .cse36 .cse38 .cse61 .cse44 .cse46)) (.cse7 (and .cse38 .cse41 .cse42 .cse44 .cse67 .cse85 .cse46)) (.cse34 (and .cse36 .cse37 .cse38 .cse39 .cse40 .cse89 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)) (.cse78 (and .cse39 .cse41 .cse42 .cse43 .cse45 .cse36 .cse37 .cse87 .cse88 .cse38 .cse89 .cse91 .cse44 .cse46)) (.cse0 (not .cse99)) (.cse1 (and .cse38 .cse82 .cse99 .cse41 .cse45 .cse46)) (.cse11 (and .cse36 .cse38 .cse39 .cse61 .cse41 .cse69 .cse43 .cse44 .cse45 .cse46)) (.cse73 (and .cse94 .cse95 .cse39 .cse41 .cse42 .cse43 .cse96 .cse45 .cse36 .cse38 .cse97 .cse44 .cse46)) (.cse81 (and .cse39 .cse64 .cse41 .cse42 .cse43 .cse45 .cse36 .cse37 .cse38 .cse89 .cse44 .cse98 .cse46)) (.cse35 (and .cse36 .cse37 .cse38 .cse39 .cse64 .cse41 .cse42 .cse43 .cse44 .cse98 .cse45 .cse46)) (.cse47 (and .cse36 .cse38 .cse39 .cse41 .cse42 .cse77 .cse43 .cse44 .cse45 .cse46)) (.cse48 (and .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse98 .cse45 .cse46)) (.cse50 (not .cse86)) (.cse51 (and .cse36 .cse94 .cse38 .cse39 .cse97 .cse41 .cse42 .cse43 .cse96 .cse44 .cse45 .cse46)) (.cse52 (and .cse36 .cse94 .cse38 .cse39 .cse97 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)) (.cse29 (not .cse39)) (.cse58 (and .cse94 .cse95 .cse39 .cse41 .cse42 .cse43 .cse96 .cse86 .cse45 .cse36 .cse38 .cse97 .cse44 .cse46 (<= 4 |ackermann_#t~ret5|))) (.cse59 (and .cse39 .cse93 .cse41 .cse42 .cse43 .cse86 .cse45 .cse36 .cse37 .cse38 .cse40 .cse89 .cse92 .cse44 .cse46)) (.cse55 (and .cse39 .cse41 .cse42 .cse43 .cse86 .cse45 .cse36 .cse37 .cse38 .cse40 .cse89 .cse92 .cse44 .cse46)) (.cse49 (and .cse36 .cse66 .cse38 .cse39 .cse61 .cse41 .cse69 .cse43 .cse44 .cse45 .cse46)) (.cse32 (not (<= 0 (+ |ackermann_#in~m| (- 1))))) (.cse53 (and .cse39 (<= 6 |ackermann_#t~ret5|) .cse41 .cse42 .cse43 .cse86 .cse45 .cse36 .cse37 .cse87 .cse88 .cse38 .cse89 .cse90 .cse91 .cse44 .cse46)) (.cse79 (and (or .cse14 .cse15 .cse17 .cse18 .cse19 .cse30 .cse31 .cse21 .cse72 .cse23 .cse24 .cse28 .cse33) (or .cse14 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse21 .cse72 .cse23 .cse24 .cse26 .cse33) (or .cse14 .cse30 .cse72) (or .cse14 .cse15 .cse16 .cse17 .cse30 .cse31 .cse21 .cse72 .cse23 .cse24 .cse26 .cse28 .cse33) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse31 .cse72 .cse23 .cse26 .cse28 .cse33) (or .cse14 .cse15 .cse16 .cse18 .cse19 .cse30 .cse31 .cse21 .cse72 .cse24 .cse26 .cse28 .cse33))) (.cse76 (not .cse63)) (.cse6 (and .cse38 .cse82 .cse41 .cse45 .cse46)) (.cse2 (and .cse38 .cse61 .cse41 .cse42 .cse44 .cse67 .cse85 .cse46)) (.cse56 (and .cse66 .cse70 .cse39 .cse83 .cse41 .cse69 .cse43 .cse45 .cse36 .cse38 .cse61 .cse84 .cse44 .cse46)) (.cse60 (and .cse36 .cse38 .cse61 .cse41 .cse42 .cse44 .cse67 .cse46)) (.cse20 (not .cse61)) (.cse22 (not .cse70)) (.cse25 (and .cse38 .cse82 .cse61 .cse41 .cse45 .cse46)) (.cse27 (not .cse66))) (and (or (not (= |ackermann_#in~n| 0)) .cse0 (not (<= 0 |ackermann_#in~n|)) .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or (and (or .cse15 .cse16 .cse17 .cse29 .cse30 .cse31 .cse21 .cse23 .cse24 .cse32 .cse26 .cse28 .cse33) (or .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 .cse31 .cse23 .cse32 .cse26 .cse28 .cse33)) .cse34 .cse35 (and .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) .cse47 .cse48 .cse6 .cse49 .cse50 .cse51 .cse52 .cse53) (or .cse54 .cse55 .cse6 .cse22 .cse56 .cse57 .cse29 .cse32 .cse58 .cse53 .cse59) (or .cse2 .cse20 (not (<= 0 |ackermann_#in~m|)) .cse60 .cse25 .cse11) (or .cse54 .cse55 .cse6 .cse56 .cse57 .cse29 .cse32 .cse58 .cse53 .cse59) (or .cse2 .cse5 (and .cse38 .cse61 .cse46) .cse62 .cse7 (and .cse38 .cse41 .cse42 .cse44 .cse45 .cse46) .cse9 .cse12 (and .cse63 .cse64 .cse44 .cse65) .cse4 (and .cse38 .cse61 .cse41 .cse42 .cse44 .cse46) .cse6 (and .cse36 .cse66 .cse38 .cse61 .cse41 .cse42 .cse44 .cse67 .cse46) .cse11 .cse13 .cse3 (and .cse38 .cse41 .cse45 .cse46) (and .cse38 .cse61 .cse41 .cse45 .cse46) .cse68 .cse60 (and .cse36 .cse66 .cse38 .cse61 .cse41 .cse69 .cse42 .cse44 .cse67 .cse46) (and .cse38 .cse61 .cse41 .cse46) (and .cse36 .cse66 .cse70 .cse71 .cse38 .cse61 .cse41 .cse69 .cse42 .cse44 .cse67 .cse46) (and .cse36 .cse66 .cse70 .cse38 .cse61 .cse41 .cse69 .cse42 .cse44 .cse67 .cse46) (and .cse38 .cse61 .cse41 .cse69 .cse44 .cse45 .cse46) .cse8 .cse10) (or .cse62 .cse6 .cse72 .cse68) (or .cse73 .cse54 .cse74 .cse29 .cse58 .cse59 .cse55 .cse6 .cse49 .cse57 .cse75 .cse76 .cse32 .cse53) (or .cse34 .cse73 .cse54 .cse74 .cse51 .cse29 (and .cse63 .cse36 .cse71 .cse38 .cse39 .cse41 .cse42 .cse77 .cse43 .cse44 .cse45 .cse46) .cse58 .cse59 .cse55 (and .cse36 .cse71 .cse38 .cse39 .cse41 .cse42 .cse77 .cse43 .cse44 .cse45 .cse46) .cse6 .cse49 .cse57 .cse75 .cse76 .cse32 .cse78 .cse53) (or .cse73 .cse54 .cse56 .cse74 .cse29 .cse58 .cse59 .cse55 .cse6 .cse22 .cse49 .cse57 .cse75 .cse32 .cse53) (or .cse20 .cse72 .cse25) (or .cse79 .cse6 .cse50) (or .cse0 .cse1) (or .cse2 (not (<= 0 (+ |ackermann_#in~m| (- 2)))) .cse6 .cse7 .cse60 .cse80) (or .cse0 .cse32 .cse1) (or .cse34 .cse81 .cse47 .cse29 .cse58 .cse59 .cse30 .cse55 .cse6 .cse49 .cse76 .cse32 .cse78 .cse53) (or .cse0 .cse72 .cse1) (or .cse2 .cse20 .cse60 .cse25 .cse11 .cse32) (or .cse73 .cse81 .cse35 .cse47 .cse48 .cse50 .cse51 .cse52 .cse29 .cse58 .cse59 .cse30 .cse55 .cse6 .cse49 .cse32 .cse53) (or .cse79 .cse6 .cse76) (or .cse6 .cse72) (or .cse2 .cse15 .cse16 .cse17 .cse56 .cse18 .cse60 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28))))))) [2023-02-17 07:58:57,592 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2023-02-17 07:58:57,592 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-02-17 07:58:57,592 INFO L899 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2023-02-17 07:58:57,592 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2023-02-17 07:58:57,592 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2023-02-17 07:58:57,593 INFO L899 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2023-02-17 07:58:57,595 INFO L445 BasicCegarLoop]: Path program histogram: [11, 1, 1] [2023-02-17 07:58:57,596 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 07:58:57,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 07:58:57 BoogieIcfgContainer [2023-02-17 07:58:57,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 07:58:57,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 07:58:57,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 07:58:57,604 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 07:58:57,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:58:33" (3/4) ... [2023-02-17 07:58:57,606 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 07:58:57,610 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2023-02-17 07:58:57,613 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-17 07:58:57,613 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-02-17 07:58:57,613 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 07:58:57,614 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 07:58:57,636 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 07:58:57,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 07:58:57,636 INFO L158 Benchmark]: Toolchain (without parser) took 24128.37ms. Allocated memory was 142.6MB in the beginning and 799.0MB in the end (delta: 656.4MB). Free memory was 110.9MB in the beginning and 706.2MB in the end (delta: -595.3MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2023-02-17 07:58:57,636 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:58:57,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.77ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 100.6MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:58:57,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.43ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:58:57,637 INFO L158 Benchmark]: Boogie Preprocessor took 25.55ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 98.1MB in the end (delta: 922.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:58:57,638 INFO L158 Benchmark]: RCFGBuilder took 218.78ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 88.1MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:58:57,638 INFO L158 Benchmark]: TraceAbstraction took 23656.30ms. Allocated memory was 142.6MB in the beginning and 799.0MB in the end (delta: 656.4MB). Free memory was 87.1MB in the beginning and 708.3MB in the end (delta: -621.2MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2023-02-17 07:58:57,638 INFO L158 Benchmark]: Witness Printer took 32.59ms. Allocated memory is still 799.0MB. Free memory was 708.3MB in the beginning and 706.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:58:57,642 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.15ms. Allocated memory is still 142.6MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.77ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 100.6MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.43ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.55ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 98.1MB in the end (delta: 922.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 218.78ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 88.1MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23656.30ms. Allocated memory was 142.6MB in the beginning and 799.0MB in the end (delta: 656.4MB). Free memory was 87.1MB in the beginning and 708.3MB in the end (delta: -621.2MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Witness Printer took 32.59ms. Allocated memory is still 799.0MB. Free memory was 708.3MB in the beginning and 706.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 13, TraceHistogramMax: 42, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 869 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 2869 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2504 mSDsCounter, 1348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6812 IncrementalHoareTripleChecker+Invalid, 8160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1348 mSolverCounterUnsat, 365 mSDtfsCounter, 6812 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4567 GetRequests, 3655 SyntacticMatches, 351 SemanticMatches, 561 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9466 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=11, InterpolantAutomatonStates: 321, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 111 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 518 PreInvPairs, 1006 NumberOfFragments, 110914 HoareAnnotationTreeSize, 518 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 3608 NumberOfCodeBlocks, 3449 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 5369 ConstructedInterpolants, 0 QuantifiedInterpolants, 12739 SizeOfPredicates, 113 NumberOfNonLiveVariables, 5052 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 37 InterpolantComputations, 1 PerfectInterpolantSequences, 41248/51465 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-17 07:58:57,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE