./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann04.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/Ackermann04.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 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 07:58:37,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 07:58:37,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 07:58:37,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 07:58:37,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 07:58:37,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 07:58:37,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 07:58:37,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 07:58:37,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 07:58:37,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 07:58:37,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 07:58:37,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 07:58:37,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 07:58:37,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 07:58:37,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 07:58:37,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 07:58:37,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 07:58:37,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 07:58:37,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 07:58:37,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 07:58:37,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 07:58:37,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 07:58:37,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 07:58:37,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 07:58:37,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 07:58:37,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 07:58:37,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 07:58:37,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 07:58:37,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 07:58:37,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 07:58:37,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 07:58:37,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 07:58:37,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 07:58:37,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 07:58:37,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 07:58:37,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 07:58:37,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 07:58:37,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 07:58:37,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 07:58:37,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 07:58:37,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 07:58:37,463 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:37,487 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 07:58:37,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 07:58:37,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 07:58:37,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 07:58:37,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 07:58:37,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 07:58:37,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 07:58:37,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 07:58:37,490 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 07:58:37,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 07:58:37,490 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 07:58:37,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 07:58:37,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 07:58:37,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 07:58:37,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 07:58:37,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 07:58:37,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 07:58:37,492 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 07:58:37,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 07:58:37,492 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 07:58:37,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 07:58:37,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 07:58:37,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 07:58:37,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 07:58:37,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:58:37,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 07:58:37,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 07:58:37,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 07:58:37,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 07:58:37,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 07:58:37,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 07:58:37,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 07:58:37,495 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 07:58:37,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 07:58:37,495 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 07:58:37,495 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 -> 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 [2023-02-17 07:58:37,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 07:58:37,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 07:58:37,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 07:58:37,724 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 07:58:37,724 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 07:58:37,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann04.c [2023-02-17 07:58:38,645 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 07:58:38,835 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 07:58:38,836 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2023-02-17 07:58:38,840 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6015195/14435dcc82bf404cb0181dfde729cb1b/FLAG0db6207db [2023-02-17 07:58:38,855 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6015195/14435dcc82bf404cb0181dfde729cb1b [2023-02-17 07:58:38,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 07:58:38,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 07:58:38,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 07:58:38,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 07:58:38,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 07:58:38,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:58:38" (1/1) ... [2023-02-17 07:58:38,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f7ccae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:38, skipping insertion in model container [2023-02-17 07:58:38,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:58:38" (1/1) ... [2023-02-17 07:58:38,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 07:58:38,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 07:58:38,975 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/Ackermann04.c[1166,1179] [2023-02-17 07:58:38,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:58:38,989 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 07:58:39,003 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/Ackermann04.c[1166,1179] [2023-02-17 07:58:39,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:58:39,015 INFO L208 MainTranslator]: Completed translation [2023-02-17 07:58:39,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:39 WrapperNode [2023-02-17 07:58:39,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 07:58:39,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 07:58:39,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 07:58:39,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 07:58:39,021 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:39" (1/1) ... [2023-02-17 07:58:39,026 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:39" (1/1) ... [2023-02-17 07:58:39,035 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-02-17 07:58:39,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 07:58:39,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 07:58:39,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 07:58:39,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 07:58:39,042 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:39" (1/1) ... [2023-02-17 07:58:39,042 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:39" (1/1) ... [2023-02-17 07:58:39,043 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:39" (1/1) ... [2023-02-17 07:58:39,043 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:39" (1/1) ... [2023-02-17 07:58:39,044 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:39" (1/1) ... [2023-02-17 07:58:39,045 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:39" (1/1) ... [2023-02-17 07:58:39,046 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:39" (1/1) ... [2023-02-17 07:58:39,046 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:39" (1/1) ... [2023-02-17 07:58:39,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 07:58:39,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 07:58:39,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 07:58:39,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 07:58:39,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:39" (1/1) ... [2023-02-17 07:58:39,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:58:39,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:39,071 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:39,077 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:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 07:58:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 07:58:39,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 07:58:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-02-17 07:58:39,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-02-17 07:58:39,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 07:58:39,138 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 07:58:39,139 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 07:58:39,257 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 07:58:39,271 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 07:58:39,271 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 07:58:39,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:58:39 BoogieIcfgContainer [2023-02-17 07:58:39,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 07:58:39,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 07:58:39,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 07:58:39,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 07:58:39,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 07:58:38" (1/3) ... [2023-02-17 07:58:39,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a367490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:58:39, skipping insertion in model container [2023-02-17 07:58:39,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:39" (2/3) ... [2023-02-17 07:58:39,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a367490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:58:39, skipping insertion in model container [2023-02-17 07:58:39,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:58:39" (3/3) ... [2023-02-17 07:58:39,293 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2023-02-17 07:58:39,305 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 07:58:39,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 07:58:39,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 07:58:39,373 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;@5901ba57, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 07:58:39,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 07:58:39,376 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:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 07:58:39,383 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:39,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:39,384 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2023-02-17 07:58:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:39,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881936895] [2023-02-17 07:58:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,606 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:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:39,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881936895] [2023-02-17 07:58:39,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881936895] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:58:39,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:58:39,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:58:39,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093609017] [2023-02-17 07:58:39,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:58:39,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:58:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:39,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:58:39,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:58:39,642 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:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:39,727 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2023-02-17 07:58:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 07:58:39,733 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:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:39,738 INFO L225 Difference]: With dead ends: 51 [2023-02-17 07:58:39,740 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 07:58:39,742 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:39,745 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:39,747 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.1s Time] [2023-02-17 07:58:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 07:58:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-17 07:58:39,775 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:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-02-17 07:58:39,779 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2023-02-17 07:58:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:39,781 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-02-17 07:58:39,781 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:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-02-17 07:58:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 07:58:39,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:39,784 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:39,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 07:58:39,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2023-02-17 07:58:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:39,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684677589] [2023-02-17 07:58:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,884 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:39,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:39,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684677589] [2023-02-17 07:58:39,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684677589] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:39,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301263996] [2023-02-17 07:58:39,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:39,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:39,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:39,891 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:39,894 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:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:39,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 07:58:39,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:40,007 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:40,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:40,052 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:40,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301263996] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:40,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:40,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-02-17 07:58:40,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953865950] [2023-02-17 07:58:40,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:40,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 07:58:40,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:40,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 07:58:40,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 07:58:40,056 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:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:40,175 INFO L93 Difference]: Finished difference Result 74 states and 126 transitions. [2023-02-17 07:58:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 07:58:40,175 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:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:40,178 INFO L225 Difference]: With dead ends: 74 [2023-02-17 07:58:40,180 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 07:58:40,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:58:40,182 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:40,183 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:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 07:58:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-17 07:58:40,194 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:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2023-02-17 07:58:40,200 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 19 [2023-02-17 07:58:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:40,201 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2023-02-17 07:58:40,202 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:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2023-02-17 07:58:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 07:58:40,204 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:40,204 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:40,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:40,405 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:40,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:40,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash -574784801, now seen corresponding path program 1 times [2023-02-17 07:58:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624189310] [2023-02-17 07:58:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,766 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:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:40,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624189310] [2023-02-17 07:58:40,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624189310] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:40,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971102182] [2023-02-17 07:58:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:40,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:40,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:40,773 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:40,774 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:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:40,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 07:58:40,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:40,866 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:40,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:41,002 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:41,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971102182] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:41,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:41,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2023-02-17 07:58:41,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153428668] [2023-02-17 07:58:41,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:41,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 07:58:41,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:41,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 07:58:41,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-17 07:58:41,006 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:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:41,088 INFO L93 Difference]: Finished difference Result 120 states and 227 transitions. [2023-02-17 07:58:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 07:58:41,089 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:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:41,095 INFO L225 Difference]: With dead ends: 120 [2023-02-17 07:58:41,095 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 07:58:41,098 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:41,100 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:41,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 82 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 07:58:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-17 07:58:41,117 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:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2023-02-17 07:58:41,118 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 45 [2023-02-17 07:58:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:41,118 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2023-02-17 07:58:41,119 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:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2023-02-17 07:58:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-02-17 07:58:41,126 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:41,126 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:41,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 07:58:41,335 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:41,335 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:41,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash -749766204, now seen corresponding path program 2 times [2023-02-17 07:58:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:41,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617791078] [2023-02-17 07:58:41,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-17 07:58:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:41,771 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:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:41,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617791078] [2023-02-17 07:58:41,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617791078] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:41,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043383553] [2023-02-17 07:58:41,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:58:41,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:41,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:41,778 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:41,780 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:41,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:58:41,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:41,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 07:58:41,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:41,891 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:41,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:42,146 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:42,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043383553] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:42,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:42,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2023-02-17 07:58:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313164895] [2023-02-17 07:58:42,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:42,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 07:58:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:42,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 07:58:42,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2023-02-17 07:58:42,151 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:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:42,362 INFO L93 Difference]: Finished difference Result 106 states and 183 transitions. [2023-02-17 07:58:42,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 07:58:42,362 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:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:42,365 INFO L225 Difference]: With dead ends: 106 [2023-02-17 07:58:42,366 INFO L226 Difference]: Without dead ends: 58 [2023-02-17 07:58:42,367 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:42,367 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:42,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 183 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-17 07:58:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2023-02-17 07:58:42,372 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:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2023-02-17 07:58:42,373 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 79 [2023-02-17 07:58:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:42,373 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2023-02-17 07:58:42,373 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:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2023-02-17 07:58:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-02-17 07:58:42,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:42,374 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:42,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 07:58:42,581 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:42,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1990672114, now seen corresponding path program 3 times [2023-02-17 07:58:42,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:42,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385948913] [2023-02-17 07:58:42,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:43,282 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:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:43,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385948913] [2023-02-17 07:58:43,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385948913] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:43,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147203547] [2023-02-17 07:58:43,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:58:43,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:43,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:43,284 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:43,312 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:43,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-02-17 07:58:43,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:43,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 07:58:43,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 428 proven. 273 refuted. 0 times theorem prover too weak. 1309 trivial. 0 not checked. [2023-02-17 07:58:43,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 428 proven. 287 refuted. 0 times theorem prover too weak. 1295 trivial. 0 not checked. [2023-02-17 07:58:43,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147203547] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:43,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:43,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 22 [2023-02-17 07:58:43,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818266846] [2023-02-17 07:58:43,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:43,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 07:58:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 07:58:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2023-02-17 07:58:43,678 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 12 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (31), 17 states have call predecessors, (31), 12 states have call successors, (31) [2023-02-17 07:58:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:43,805 INFO L93 Difference]: Finished difference Result 133 states and 250 transitions. [2023-02-17 07:58:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 07:58:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 12 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (31), 17 states have call predecessors, (31), 12 states have call successors, (31) Word has length 197 [2023-02-17 07:58:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:43,807 INFO L225 Difference]: With dead ends: 133 [2023-02-17 07:58:43,807 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 07:58:43,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 426 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2023-02-17 07:58:43,808 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:43,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 142 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 07:58:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2023-02-17 07:58:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 13 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (46), 16 states have call predecessors, (46), 13 states have call successors, (46) [2023-02-17 07:58:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2023-02-17 07:58:43,831 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 197 [2023-02-17 07:58:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:43,832 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2023-02-17 07:58:43,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 12 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (31), 17 states have call predecessors, (31), 12 states have call successors, (31) [2023-02-17 07:58:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2023-02-17 07:58:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-17 07:58:43,842 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:43,843 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:43,860 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:44,051 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:44,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1538229242, now seen corresponding path program 4 times [2023-02-17 07:58:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:44,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208179754] [2023-02-17 07:58:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,313 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,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-17 07:58:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:44,488 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:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208179754] [2023-02-17 07:58:44,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208179754] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688120643] [2023-02-17 07:58:44,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 07:58:44,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:44,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:44,490 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:44,493 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:44,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 07:58:44,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:44,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 07:58:44,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:44,654 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:44,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:44,870 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:44,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688120643] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:44,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:44,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2023-02-17 07:58:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255134436] [2023-02-17 07:58:44,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:44,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 07:58:44,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:44,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 07:58:44,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-02-17 07:58:44,872 INFO L87 Difference]: Start difference. First operand 77 states and 117 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:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:45,142 INFO L93 Difference]: Finished difference Result 153 states and 265 transitions. [2023-02-17 07:58:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 07:58:45,142 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:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:45,143 INFO L225 Difference]: With dead ends: 153 [2023-02-17 07:58:45,143 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 07:58:45,145 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:45,145 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:45,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 194 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:58:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 07:58:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-17 07:58:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 15 states have call successors, (15), 9 states have call predecessors, (15), 11 states have return successors, (46), 16 states have call predecessors, (46), 15 states have call successors, (46) [2023-02-17 07:58:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2023-02-17 07:58:45,153 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 131 [2023-02-17 07:58:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:45,153 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2023-02-17 07:58:45,154 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:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2023-02-17 07:58:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-17 07:58:45,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:45,155 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:45,162 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:45,363 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:45,363 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:45,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1811622132, now seen corresponding path program 5 times [2023-02-17 07:58:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:45,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783370510] [2023-02-17 07:58:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-02-17 07:58:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:45,782 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:45,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:45,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783370510] [2023-02-17 07:58:45,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783370510] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:45,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775168410] [2023-02-17 07:58:45,783 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 07:58:45,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:45,784 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:45,786 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:45,889 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-17 07:58:45,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:45,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 07:58:45,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:45,937 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:45,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:46,166 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:46,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775168410] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:46,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:46,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2023-02-17 07:58:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199129526] [2023-02-17 07:58:46,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:46,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 07:58:46,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:46,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 07:58:46,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-02-17 07:58:46,169 INFO L87 Difference]: Start difference. First operand 85 states and 127 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:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:46,437 INFO L93 Difference]: Finished difference Result 176 states and 301 transitions. [2023-02-17 07:58:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 07:58:46,437 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:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:46,441 INFO L225 Difference]: With dead ends: 176 [2023-02-17 07:58:46,441 INFO L226 Difference]: Without dead ends: 100 [2023-02-17 07:58:46,442 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:46,443 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:46,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 198 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:58:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-17 07:58:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-17 07:58:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (59), 22 states have call predecessors, (59), 18 states have call successors, (59) [2023-02-17 07:58:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 152 transitions. [2023-02-17 07:58:46,461 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 152 transitions. Word has length 131 [2023-02-17 07:58:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:46,462 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 152 transitions. [2023-02-17 07:58:46,462 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:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 152 transitions. [2023-02-17 07:58:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-02-17 07:58:46,464 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:46,464 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:46,472 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:46,670 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:46,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1701842998, now seen corresponding path program 6 times [2023-02-17 07:58:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:46,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323958040] [2023-02-17 07:58:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:47,441 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:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323958040] [2023-02-17 07:58:47,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323958040] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274467007] [2023-02-17 07:58:47,441 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 07:58:47,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:47,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:47,445 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:47,447 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:47,609 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2023-02-17 07:58:47,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:47,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 07:58:47,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:47,701 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:47,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:48,238 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:48,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274467007] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:48,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:48,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 27] total 37 [2023-02-17 07:58:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152170366] [2023-02-17 07:58:48,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:48,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-17 07:58:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-17 07:58:48,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 07:58:48,242 INFO L87 Difference]: Start difference. First operand 100 states and 152 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:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:48,722 INFO L93 Difference]: Finished difference Result 206 states and 359 transitions. [2023-02-17 07:58:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-17 07:58:48,722 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:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:48,725 INFO L225 Difference]: With dead ends: 206 [2023-02-17 07:58:48,725 INFO L226 Difference]: Without dead ends: 115 [2023-02-17 07:58:48,727 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:48,727 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:48,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 257 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:58:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-17 07:58:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-02-17 07:58:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.105263157894737) internal successors, (84), 77 states have internal predecessors, (84), 21 states have call successors, (21), 9 states have call predecessors, (21), 17 states have return successors, (80), 28 states have call predecessors, (80), 21 states have call successors, (80) [2023-02-17 07:58:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 185 transitions. [2023-02-17 07:58:48,742 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 185 transitions. Word has length 157 [2023-02-17 07:58:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:48,742 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 185 transitions. [2023-02-17 07:58:48,743 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:48,743 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 185 transitions. [2023-02-17 07:58:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-17 07:58:48,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:48,745 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:48,755 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:48,951 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:48,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash 332854534, now seen corresponding path program 7 times [2023-02-17 07:58:48,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:48,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207698228] [2023-02-17 07:58:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-17 07:58:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 686 proven. 70 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2023-02-17 07:58:49,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:49,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207698228] [2023-02-17 07:58:49,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207698228] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:49,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805517165] [2023-02-17 07:58:49,839 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 07:58:49,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:49,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:49,840 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:49,842 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:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:50,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-17 07:58:50,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2023-02-17 07:58:50,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2023-02-17 07:58:50,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805517165] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:50,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:50,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 38 [2023-02-17 07:58:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999417588] [2023-02-17 07:58:50,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:50,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-17 07:58:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-17 07:58:50,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 07:58:50,858 INFO L87 Difference]: Start difference. First operand 115 states and 185 transitions. Second operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2023-02-17 07:58:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:51,466 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2023-02-17 07:58:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-17 07:58:51,467 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) Word has length 183 [2023-02-17 07:58:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:51,469 INFO L225 Difference]: With dead ends: 155 [2023-02-17 07:58:51,469 INFO L226 Difference]: Without dead ends: 151 [2023-02-17 07:58:51,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 363 SyntacticMatches, 48 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=710, Invalid=3450, Unknown=0, NotChecked=0, Total=4160 [2023-02-17 07:58:51,472 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:51,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 279 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 07:58:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-17 07:58:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 138. [2023-02-17 07:58:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 91 states have (on average 1.0879120879120878) internal successors, (99), 92 states have internal predecessors, (99), 22 states have call successors, (22), 9 states have call predecessors, (22), 24 states have return successors, (121), 36 states have call predecessors, (121), 22 states have call successors, (121) [2023-02-17 07:58:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 242 transitions. [2023-02-17 07:58:51,485 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 242 transitions. Word has length 183 [2023-02-17 07:58:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:51,485 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 242 transitions. [2023-02-17 07:58:51,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2023-02-17 07:58:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 242 transitions. [2023-02-17 07:58:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-02-17 07:58:51,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:51,487 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:51,497 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:51,695 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:51,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:51,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -860565711, now seen corresponding path program 8 times [2023-02-17 07:58:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:51,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386165045] [2023-02-17 07:58:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 07:58:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:58:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-17 07:58:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 07:58:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 07:58:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-17 07:58:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-17 07:58:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:52,423 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:52,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:52,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386165045] [2023-02-17 07:58:52,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386165045] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:58:52,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296110480] [2023-02-17 07:58:52,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:58:52,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:58:52,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:52,425 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:52,427 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:52,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:58:52,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:58:52,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-17 07:58:52,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:58:52,783 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:52,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:58:53,324 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:53,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296110480] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:58:53,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:58:53,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 34 [2023-02-17 07:58:53,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058535913] [2023-02-17 07:58:53,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:58:53,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 07:58:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 07:58:53,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 07:58:53,328 INFO L87 Difference]: Start difference. First operand 138 states and 242 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:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:53,778 INFO L93 Difference]: Finished difference Result 255 states and 507 transitions. [2023-02-17 07:58:53,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-17 07:58:53,778 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:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:53,779 INFO L225 Difference]: With dead ends: 255 [2023-02-17 07:58:53,779 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 07:58:53,782 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:53,782 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:53,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 198 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:58:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 07:58:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 07:58:53,784 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:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 07:58:53,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2023-02-17 07:58:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:53,784 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 07:58:53,785 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:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 07:58:53,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 07:58:53,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 07:58:53,811 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:53,993 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:53,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 07:58:54,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 07:58:54,027 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 07:58:54,027 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2023-02-17 07:58:54,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 07:58:54,027 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 47) the Hoare annotation is: true [2023-02-17 07:58:54,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2023-02-17 07:58:54,028 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-17 07:58:54,028 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-02-17 07:58:54,028 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 07:58:54,028 INFO L902 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2023-02-17 07:58:54,028 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2023-02-17 07:58:54,028 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2023-02-17 07:58:54,028 INFO L899 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2023-02-17 07:58:54,031 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (let ((.cse49 (= 1 |ackermann_#in~n|)) (.cse48 (<= 0 (+ |ackermann_#res| (- 2)))) (.cse35 (< |ackermann_#in~n| 3)) (.cse42 (< |ackermann_#in~n| 4)) (.cse37 (< |ackermann_#in~n| 5)) (.cse32 (< |ackermann_#in~n| 2)) (.cse39 (< |ackermann_#in~n| 6))) (let ((.cse40 (< 6 |ackermann_#res|)) (.cse33 (<= |ackermann_#in~n| 1)) (.cse43 (not .cse39)) (.cse10 (not .cse32)) (.cse38 (< 2 |ackermann_#res|)) (.cse45 (not .cse37)) (.cse36 (< 5 |ackermann_#res|)) (.cse41 (< 4 |ackermann_#res|)) (.cse46 (not .cse42)) (.cse34 (< 3 |ackermann_#res|)) (.cse47 (not .cse35)) (.cse44 (+ ackermann_~n 1)) (.cse29 (or (not .cse49) .cse48)) (.cse18 (= |ackermann_#in~n| ackermann_~n)) (.cse27 (<= ackermann_~m 1)) (.cse25 (<= |ackermann_#in~m| 0)) (.cse24 (= ackermann_~m |ackermann_#in~m|)) (.cse26 (<= |ackermann_#in~n| 0)) (.cse16 (= |ackermann_#in~m| ackermann_~m)) (.cse28 (= ackermann_~n |ackermann_#in~n|)) (.cse14 (<= |ackermann_#in~m| 1))) (let ((.cse13 (<= ackermann_~m 2)) (.cse19 (not .cse14)) (.cse31 (and .cse24 .cse26 .cse16 .cse28)) (.cse23 (not .cse26)) (.cse1 (not (= |ackermann_#in~m| 0))) (.cse30 (and (not .cse48) .cse49)) (.cse21 (not .cse25)) (.cse22 (and .cse24 .cse25 .cse16 .cse27 .cse28)) (.cse15 (or (and .cse24 .cse16 .cse18 .cse28 .cse29) (and .cse24 .cse16 .cse18 .cse28))) (.cse20 (not (<= 0 (+ |ackermann_#in~m| (- 1))))) (.cse0 (and .cse47 (not (< 3 .cse44)))) (.cse2 (and .cse47 (not .cse34))) (.cse3 (and (not (< 4 .cse44)) .cse46)) (.cse4 (and (not .cse41) .cse46)) (.cse17 (<= 0 (+ ackermann_~m (- 1)))) (.cse5 (and .cse45 (not .cse36))) (.cse6 (and .cse10 (not .cse38))) (.cse7 (and .cse43 (not (< 6 .cse44)))) (.cse8 (and .cse45 (not (< 5 .cse44)))) (.cse9 (and .cse10 (not (< 2 .cse44)))) (.cse11 (not .cse33)) (.cse12 (and (not .cse40) .cse43))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20) (or .cse21 .cse22) .cse15 (or .cse23 .cse21 (and .cse24 .cse25 .cse26 .cse16 .cse27 .cse28)) .cse16 (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29) .cse30 .cse19 .cse20) (or .cse23 .cse31) (or .cse10 .cse21 (and .cse24 .cse25 .cse32 .cse16 .cse27 .cse28)) (or .cse30 (and .cse15 .cse16 .cse17 .cse18 .cse29) .cse20) (or .cse23 .cse31 (and .cse23 (or .cse23 .cse20))) (or .cse1 .cse30 .cse21 .cse22) (or (and .cse15 .cse16 .cse17 .cse18) .cse20) (or .cse0 .cse2 .cse3 .cse4 (and .cse33 (or .cse34 .cse35) (or .cse36 .cse37) (or .cse38 .cse32) (or (and .cse24 .cse32 .cse16 .cse17 .cse18 .cse28) (and .cse24 .cse32 .cse16 .cse18 .cse28)) (or .cse39 .cse40) .cse18 (or .cse41 .cse42)) .cse5 .cse6 .cse7 .cse8 .cse9 (and (or .cse10 (not (<= 0 |ackermann_#in~m|))) .cse10) .cse11 .cse12) .cse18)))) [2023-02-17 07:58:54,031 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2023-02-17 07:58:54,034 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (let ((.cse15 (= |ackermann_#in~n| 0)) (.cse38 (= ackermann_~m |ackermann_#in~m|)) (.cse39 (= |ackermann_#in~m| ackermann_~m)) (.cse51 (<= 0 (+ ackermann_~m (- 1)))) (.cse17 (= |ackermann_#in~n| ackermann_~n)) (.cse40 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse36 (< 6 |ackermann_#res|)) (.cse44 (< 5 |ackermann_#res|)) (.cse45 (< 4 |ackermann_#res|)) (.cse43 (< 2 |ackermann_#res|)) (.cse48 (< 3 |ackermann_#res|)) (.cse57 (< |ackermann_#in~n| 3)) (.cse55 (< |ackermann_#in~n| 4)) (.cse1 (and .cse15 .cse38 .cse39 .cse51 .cse17 .cse40)) (.cse5 (and .cse15 .cse38 .cse39 .cse17 .cse40)) (.cse54 (< |ackermann_#in~n| 5)) (.cse56 (< |ackermann_#in~n| 2)) (.cse53 (< |ackermann_#in~n| 6))) (let ((.cse37 (not .cse53)) (.cse11 (not .cse56)) (.cse42 (not .cse54)) (.cse33 (or .cse1 .cse5)) (.cse46 (not .cse55)) (.cse47 (not .cse57)) (.cse41 (+ ackermann_~n 1)) (.cse49 (<= |ackermann_#in~m| 0)) (.cse19 (or .cse48 .cse57)) (.cse0 (or .cse43 .cse56)) (.cse12 (or .cse45 .cse55)) (.cse34 (or .cse44 .cse54)) (.cse35 (or .cse53 .cse36)) (.cse16 (or (< 1 |ackermann_#res|) (not (>= |ackermann_#in~n| 1)))) (.cse52 (<= ackermann_~m 2)) (.cse50 (<= |ackermann_#in~m| 1))) (let ((.cse18 (and .cse52 .cse15 .cse38 .cse50 .cse39 .cse51 .cse17 .cse40)) (.cse13 (and .cse19 .cse50 .cse0 .cse39 .cse51 .cse12 .cse52 .cse15 .cse34 .cse38 .cse35 .cse16 .cse17 .cse40)) (.cse14 (not .cse50)) (.cse6 (not (<= 0 (+ |ackermann_#in~m| (- 1))))) (.cse7 (not (<= |ackermann_#in~n| 0))) (.cse21 (not (= |ackermann_#in~m| 0))) (.cse2 (and (not (<= 0 (+ |ackermann_#res| (- 2)))) (= 1 |ackermann_#in~n|))) (.cse8 (not .cse49)) (.cse10 (and .cse15 .cse38 .cse49 .cse39 (<= ackermann_~m 1) .cse40)) (.cse20 (and .cse47 (not (< 3 .cse41)))) (.cse22 (and .cse47 (not .cse48))) (.cse23 (and (not (< 4 .cse41)) .cse46)) (.cse24 (and (not .cse45) .cse46)) (.cse3 (and .cse15 .cse33 .cse17)) (.cse25 (and .cse42 (not .cse44))) (.cse4 (and .cse19 .cse15 .cse34 .cse0 .cse35 .cse33 .cse16 .cse17 .cse12)) (.cse26 (and .cse11 (not .cse43))) (.cse27 (and .cse37 (not (< 6 .cse41)))) (.cse28 (and .cse42 (not (< 5 .cse41)))) (.cse29 (and .cse11 (not (< 2 .cse41)))) (.cse9 (and .cse15 .cse38 .cse40)) (.cse30 (and .cse15 .cse38 .cse39 .cse40)) (.cse31 (not (<= |ackermann_#in~n| 1))) (.cse32 (and (not .cse36) .cse37))) (and .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse8 .cse9 .cse10) .cse12 (or .cse13 .cse14 .cse6) (or .cse4 .cse6) .cse15 (or .cse7 .cse8 .cse10) (or .cse7 .cse4 (and .cse7 (or .cse7 .cse6))) (or .cse3 .cse4 .cse6) .cse16 .cse17 (or .cse18 .cse2 .cse13 .cse5 .cse14 .cse6) (or .cse18 .cse13 .cse14 .cse6) .cse19 (or .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse5 .cse26 .cse27 .cse28 .cse29 .cse11 .cse9 .cse30 .cse31 .cse32) (or .cse3 .cse9 .cse30 .cse4 .cse5) .cse33 .cse34 (or .cse7 .cse9 .cse30) .cse35 (or .cse8 .cse10) (or .cse21 .cse2 .cse8 .cse10) (or .cse20 .cse1 .cse22 .cse23 .cse24 .cse3 .cse25 .cse4 .cse5 .cse26 .cse27 .cse28 .cse29 (and (or .cse11 (not (<= 0 |ackermann_#in~m|))) .cse11) .cse9 .cse30 .cse31 .cse32)))))) [2023-02-17 07:58:54,034 INFO L895 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse38 (< |ackermann_#in~n| 2))) (let ((.cse57 (<= |ackermann_#in~n| 0)) (.cse58 (not (< |ackermann_#in~n| 6))) (.cse41 (not .cse38)) (.cse63 (not (< |ackermann_#in~n| 5))) (.cse64 (not (< |ackermann_#in~n| 4))) (.cse65 (not (< |ackermann_#in~n| 3))) (.cse62 (+ ackermann_~n 1)) (.cse59 (<= |ackermann_#in~n| 1)) (.cse67 (<= |ackermann_#in~n| 4)) (.cse29 (<= |ackermann_#in~n| 3)) (.cse28 (<= 0 (+ |ackermann_#t~ret5| (- 5)))) (.cse68 (<= |ackermann_#in~n| 2)) (.cse66 (<= 0 (+ |ackermann_#t~ret5| (- 6)))) (.cse34 (<= 0 (+ ackermann_~m (- 2)))) (.cse40 (<= 0 (+ |ackermann_#t~ret5| (- 2)))) (.cse36 (<= ackermann_~m 2)) (.cse31 (= |ackermann_#in~m| ackermann_~m)) (.cse32 (<= 0 (+ |ackermann_#t~ret5| (- 3)))) (.cse61 (<= 0 (+ ackermann_~m (- 1)))) (.cse33 (= |ackermann_#in~n| ackermann_~n)) (.cse39 (<= ackermann_~m 1)) (.cse30 (= ackermann_~m |ackermann_#in~m|)) (.cse56 (= |ackermann_#in~m| 0)) (.cse35 (= ackermann_~n |ackermann_#in~n|)) (.cse60 (<= |ackermann_#in~m| 1))) (let ((.cse8 (not .cse60)) (.cse23 (and .cse30 .cse56 .cse35)) (.cse25 (and .cse36 .cse30 .cse60 .cse31 .cse32 .cse61 .cse33 .cse39 .cse35)) (.cse26 (and .cse36 .cse30 .cse60 .cse38 .cse31 .cse40 .cse61 .cse33 .cse39 .cse35)) (.cse24 (and .cse30 .cse56)) (.cse16 (and .cse28 .cse30 .cse31 .cse32 .cse68 .cse66 .cse33 .cse34 .cse35)) (.cse22 (and .cse28 .cse68 (or (and .cse36 .cse28 .cse30 .cse31 .cse32 .cse68 .cse33 .cse34 .cse35) (and .cse36 .cse28 .cse30 .cse31 .cse32 .cse68 .cse66 .cse33 .cse34 .cse35)) .cse33)) (.cse27 (and .cse30 .cse31 .cse32 .cse68 .cse33 .cse34 .cse35)) (.cse11 (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse66 .cse33 .cse34 .cse35)) (.cse4 (and .cse36 .cse30 .cse60 .cse31 .cse32 .cse68 .cse61 .cse33 .cse39 .cse35)) (.cse5 (and .cse36 .cse28 .cse30 .cse60 .cse31 .cse32 .cse61 .cse33 .cse67 .cse39 .cse35)) (.cse12 (and .cse36 .cse28 .cse29 .cse30 .cse31 .cse32 .cse66 .cse33 .cse34 .cse35)) (.cse14 (and .cse59 .cse30 .cse38 .cse31 .cse32 .cse33 .cse34 .cse35)) (.cse10 (and .cse36 .cse29 .cse30 .cse60 (<= 0 (+ |ackermann_#t~ret5| (- 4))) .cse31 .cse32 .cse61 .cse33 .cse39 .cse35)) (.cse37 (and .cse36 .cse30 .cse31 .cse32 .cse68 .cse33 .cse34 .cse35)) (.cse17 (and .cse28 .cse30 .cse31 .cse32 .cse66 .cse33 .cse34 .cse35)) (.cse1 (and (not (<= 0 (+ |ackermann_#res| (- 2)))) (= 1 |ackermann_#in~n|))) (.cse18 (and .cse36 .cse28 .cse30 .cse31 .cse32 .cse66 .cse33 .cse34 .cse35)) (.cse19 (and .cse36 .cse59 .cse30 .cse38 .cse31 .cse32 .cse33 .cse34 .cse35)) (.cse6 (and .cse36 .cse28 .cse30 .cse60 .cse31 .cse32 .cse61 .cse66 .cse33 .cse39 .cse35)) (.cse20 (and .cse36 .cse28 .cse30 .cse31 .cse32 .cse66 .cse33 .cse34 .cse67 .cse35)) (.cse21 (and .cse28 .cse30 .cse31 .cse32 .cse66 .cse33 .cse34 .cse67 .cse35)) (.cse9 (not (<= 0 (+ |ackermann_#in~m| (- 1))))) (.cse0 (not .cse56)) (.cse45 (and .cse65 (not (< 3 .cse62)))) (.cse46 (and .cse65 (not (< 3 |ackermann_#res|)))) (.cse47 (and (not (< 4 .cse62)) .cse64)) (.cse48 (and (not (< 4 |ackermann_#res|)) .cse64)) (.cse49 (and .cse63 (not (< 5 |ackermann_#res|)))) (.cse13 (and .cse36 .cse59 .cse30 .cse38 .cse31 .cse40 .cse32 .cse33 .cse34 .cse35)) (.cse50 (and .cse41 (not (< 2 |ackermann_#res|)))) (.cse15 (and .cse59 .cse30 .cse38 .cse31 .cse40 .cse32 .cse33 .cse34 .cse35)) (.cse51 (and .cse58 (not (< 6 .cse62)))) (.cse52 (and .cse63 (not (< 5 .cse62)))) (.cse53 (and .cse41 (not (< 2 .cse62)))) (.cse7 (and .cse36 .cse59 .cse30 .cse60 .cse38 .cse31 .cse40 .cse61 .cse33 .cse39 .cse35)) (.cse42 (and .cse30 .cse56 .cse38 .cse31 .cse39 .cse35)) (.cse54 (not .cse59)) (.cse55 (and (not (< 6 |ackermann_#res|)) .cse58)) (.cse43 (not .cse57)) (.cse44 (and .cse30 .cse56 .cse57 .cse31 .cse39 .cse35)) (.cse2 (and .cse30 .cse56 .cse31 .cse39 .cse35)) (.cse3 (not (<= |ackermann_#in~m| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse4 .cse5 .cse12 .cse13 .cse14 .cse10 .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse20 .cse6 .cse7 .cse21 .cse22 .cse9) (or .cse23 .cse2 .cse3 .cse24) (or .cse11 .cse13 .cse12 .cse15 .cse25 .cse16 .cse17 .cse18 .cse2 .cse20 .cse21 .cse22 .cse26) (or .cse11 .cse4 .cse5 .cse13 .cse12 .cse10 .cse15 .cse16 .cse17 .cse18 .cse2 .cse6 .cse20 .cse7 .cse21 .cse22 .cse9) (or .cse27 .cse11 .cse4 .cse5 (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) .cse12 .cse14 .cse10 (and .cse36 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) .cse37 .cse17 .cse1 .cse18 .cse19 .cse2 .cse6 .cse20 .cse21 .cse7 .cse9) (or .cse11 (and .cse30 .cse38 .cse35) .cse23 (and .cse30 .cse31 .cse32 .cse33 .cse39 .cse35) .cse25 (and .cse30 .cse38 .cse31 .cse32 .cse33 .cse35) .cse18 .cse19 .cse2 .cse21 .cse26 (and .cse30 .cse31 .cse39 .cse35) (and .cse30 .cse38 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse30 .cse38 .cse31 .cse39 .cse35) .cse24 (and .cse36 .cse30 .cse38 .cse31 .cse32 .cse33 .cse34 .cse35) .cse12 .cse13 .cse14 .cse15 (and .cse30 .cse38 .cse31 .cse35) .cse16 .cse17 .cse20 (and .cse30 .cse38 .cse31 .cse40 .cse33 .cse39 .cse35) .cse22) (or .cse41 .cse3 .cse42) (or .cse43 .cse44 (and .cse43 (or .cse43 .cse9))) (or .cse27 .cse11 .cse4 .cse5 .cse12 .cse14 .cse10 .cse37 .cse17 .cse1 .cse18 .cse19 .cse2 .cse6 .cse20 .cse21 .cse7 .cse9) (or .cse45 .cse0 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse41 .cse42 .cse54 .cse55) (or .cse43 .cse44) (or .cse45 .cse46 .cse47 .cse48 .cse49 .cse13 .cse50 .cse15 .cse51 .cse52 .cse53 (and (or .cse41 (not (<= 0 |ackermann_#in~m|))) .cse41) .cse7 .cse42 .cse54 .cse55) (or .cse43 .cse3 .cse44) (or .cse2 .cse3))))) [2023-02-17 07:58:54,034 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2023-02-17 07:58:54,035 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-02-17 07:58:54,035 INFO L899 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2023-02-17 07:58:54,035 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2023-02-17 07:58:54,035 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2023-02-17 07:58:54,035 INFO L899 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2023-02-17 07:58:54,037 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2023-02-17 07:58:54,039 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 07:58:54,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 07:58:54 BoogieIcfgContainer [2023-02-17 07:58:54,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 07:58:54,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 07:58:54,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 07:58:54,046 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 07:58:54,046 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:39" (3/4) ... [2023-02-17 07:58:54,048 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 07:58:54,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2023-02-17 07:58:54,056 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-17 07:58:54,056 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-02-17 07:58:54,057 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 07:58:54,057 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 07:58:54,084 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 07:58:54,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 07:58:54,085 INFO L158 Benchmark]: Toolchain (without parser) took 15226.85ms. Allocated memory was 104.9MB in the beginning and 526.4MB in the end (delta: 421.5MB). Free memory was 73.6MB in the beginning and 394.0MB in the end (delta: -320.4MB). Peak memory consumption was 102.5MB. Max. memory is 16.1GB. [2023-02-17 07:58:54,085 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:58:54,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.45ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 63.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 07:58:54,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.71ms. Allocated memory is still 104.9MB. Free memory was 63.1MB in the beginning and 61.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:58:54,086 INFO L158 Benchmark]: Boogie Preprocessor took 11.63ms. Allocated memory is still 104.9MB. Free memory was 61.9MB in the beginning and 60.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:58:54,086 INFO L158 Benchmark]: RCFGBuilder took 224.52ms. Allocated memory is still 104.9MB. Free memory was 60.7MB in the beginning and 51.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 07:58:54,086 INFO L158 Benchmark]: TraceAbstraction took 14771.34ms. Allocated memory was 104.9MB in the beginning and 526.4MB in the end (delta: 421.5MB). Free memory was 50.6MB in the beginning and 397.2MB in the end (delta: -346.6MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2023-02-17 07:58:54,087 INFO L158 Benchmark]: Witness Printer took 38.62ms. Allocated memory is still 526.4MB. Free memory was 397.2MB in the beginning and 394.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 07:58:54,088 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.14ms. Allocated memory is still 104.9MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.45ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 63.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.71ms. Allocated memory is still 104.9MB. Free memory was 63.1MB in the beginning and 61.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.63ms. Allocated memory is still 104.9MB. Free memory was 61.9MB in the beginning and 60.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 224.52ms. Allocated memory is still 104.9MB. Free memory was 60.7MB in the beginning and 51.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14771.34ms. Allocated memory was 104.9MB in the beginning and 526.4MB in the end (delta: 421.5MB). Free memory was 50.6MB in the beginning and 397.2MB in the end (delta: -346.6MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Witness Printer took 38.62ms. Allocated memory is still 526.4MB. Free memory was 397.2MB in the beginning and 394.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 14.7s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 403 mSDsluCounter, 1696 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1449 mSDsCounter, 629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3556 IncrementalHoareTripleChecker+Invalid, 4185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 629 mSolverCounterUnsat, 247 mSDtfsCounter, 3556 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2845 GetRequests, 2253 SyntacticMatches, 231 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5014 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=9, InterpolantAutomatonStates: 205, 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, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 490 PreInvPairs, 1045 NumberOfFragments, 7383 HoareAnnotationTreeSize, 490 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2236 NumberOfCodeBlocks, 2162 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3320 ConstructedInterpolants, 0 QuantifiedInterpolants, 7593 SizeOfPredicates, 72 NumberOfNonLiveVariables, 3227 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 20659/25458 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:54,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE