./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci03.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/Fibonacci03.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 be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 07:58:57,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 07:58:57,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 07:58:57,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 07:58:57,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 07:58:57,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 07:58:57,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 07:58:57,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 07:58:57,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 07:58:57,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 07:58:57,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 07:58:57,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 07:58:57,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 07:58:57,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 07:58:57,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 07:58:57,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 07:58:57,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 07:58:57,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 07:58:57,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 07:58:57,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 07:58:57,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 07:58:57,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 07:58:57,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 07:58:57,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 07:58:57,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 07:58:57,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 07:58:57,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 07:58:57,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 07:58:57,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 07:58:57,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 07:58:57,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 07:58:57,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 07:58:57,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 07:58:57,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 07:58:57,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 07:58:57,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 07:58:57,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 07:58:57,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 07:58:57,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 07:58:57,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 07:58:57,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 07:58:57,378 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:57,404 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 07:58:57,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 07:58:57,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 07:58:57,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 07:58:57,406 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 07:58:57,406 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 07:58:57,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 07:58:57,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 07:58:57,407 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 07:58:57,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 07:58:57,408 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 07:58:57,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 07:58:57,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 07:58:57,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 07:58:57,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 07:58:57,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 07:58:57,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 07:58:57,408 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 07:58:57,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 07:58:57,409 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 07:58:57,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 07:58:57,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 07:58:57,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 07:58:57,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 07:58:57,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:58:57,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 07:58:57,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 07:58:57,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 07:58:57,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 07:58:57,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 07:58:57,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 07:58:57,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 07:58:57,411 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 07:58:57,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 07:58:57,411 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 07:58:57,411 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 -> be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 [2023-02-17 07:58:57,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 07:58:57,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 07:58:57,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 07:58:57,669 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 07:58:57,669 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 07:58:57,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci03.c [2023-02-17 07:58:58,634 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 07:58:58,761 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 07:58:58,761 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci03.c [2023-02-17 07:58:58,766 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/376852eaa/1c52a99028334341b01013806f7abb0a/FLAGc38306e74 [2023-02-17 07:58:58,776 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/376852eaa/1c52a99028334341b01013806f7abb0a [2023-02-17 07:58:58,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 07:58:58,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 07:58:58,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 07:58:58,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 07:58:58,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 07:58:58,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:58:58" (1/1) ... [2023-02-17 07:58:58,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e8aa24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:58, skipping insertion in model container [2023-02-17 07:58:58,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:58:58" (1/1) ... [2023-02-17 07:58:58,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 07:58:58,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 07:58:58,909 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/Fibonacci03.c[788,801] [2023-02-17 07:58:58,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:58:58,923 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 07:58:58,935 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/Fibonacci03.c[788,801] [2023-02-17 07:58:58,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:58:58,945 INFO L208 MainTranslator]: Completed translation [2023-02-17 07:58:58,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:58 WrapperNode [2023-02-17 07:58:58,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 07:58:58,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 07:58:58,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 07:58:58,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 07:58:58,951 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:58" (1/1) ... [2023-02-17 07:58:58,956 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:58" (1/1) ... [2023-02-17 07:58:58,968 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2023-02-17 07:58:58,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 07:58:58,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 07:58:58,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 07:58:58,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 07:58:58,976 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:58" (1/1) ... [2023-02-17 07:58:58,976 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:58" (1/1) ... [2023-02-17 07:58:58,978 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:58" (1/1) ... [2023-02-17 07:58:58,978 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:58" (1/1) ... [2023-02-17 07:58:58,984 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:58" (1/1) ... [2023-02-17 07:58:58,986 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:58" (1/1) ... [2023-02-17 07:58:58,987 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:58" (1/1) ... [2023-02-17 07:58:58,988 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:58" (1/1) ... [2023-02-17 07:58:58,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 07:58:58,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 07:58:58,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 07:58:58,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 07:58:58,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:58" (1/1) ... [2023-02-17 07:58:59,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:58:59,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:58:59,021 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:59,028 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:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-17 07:58:59,064 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-17 07:58:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 07:58:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 07:58:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 07:58:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 07:58:59,111 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 07:58:59,112 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 07:58:59,230 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 07:58:59,237 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 07:58:59,239 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 07:58:59,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:58:59 BoogieIcfgContainer [2023-02-17 07:58:59,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 07:58:59,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 07:58:59,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 07:58:59,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 07:58:59,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 07:58:58" (1/3) ... [2023-02-17 07:58:59,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f84fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:58:59, skipping insertion in model container [2023-02-17 07:58:59,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:58:58" (2/3) ... [2023-02-17 07:58:59,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f84fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:58:59, skipping insertion in model container [2023-02-17 07:58:59,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:58:59" (3/3) ... [2023-02-17 07:58:59,251 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2023-02-17 07:58:59,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 07:58:59,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 07:58:59,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 07:58:59,319 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;@43ad6f85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 07:58:59,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 07:58:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 07:58:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 07:58:59,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:59,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:59,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1939714822, now seen corresponding path program 1 times [2023-02-17 07:58:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:59,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074861804] [2023-02-17 07:58:59,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:59,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:59,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:59,534 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:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:59,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074861804] [2023-02-17 07:58:59,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074861804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:58:59,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:58:59,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:58:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408120755] [2023-02-17 07:58:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:58:59,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:58:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:58:59,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:58:59,560 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 07:58:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:59,664 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-02-17 07:58:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 07:58:59,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-17 07:58:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:59,671 INFO L225 Difference]: With dead ends: 32 [2023-02-17 07:58:59,671 INFO L226 Difference]: Without dead ends: 19 [2023-02-17 07:58:59,673 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:59,676 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:59,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:58:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-17 07:58:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-17 07:58:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 07:58:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-17 07:58:59,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2023-02-17 07:58:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:59,701 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-17 07:58:59,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 07:58:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-17 07:58:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 07:58:59,703 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:59,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:59,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 07:58:59,703 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:59,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:59,704 INFO L85 PathProgramCache]: Analyzing trace with hash 692912656, now seen corresponding path program 1 times [2023-02-17 07:58:59,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:59,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767621690] [2023-02-17 07:58:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:59,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:59,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:59,787 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:59,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:58:59,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767621690] [2023-02-17 07:58:59,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767621690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:58:59,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:58:59,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:58:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463077687] [2023-02-17 07:58:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:58:59,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:58:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:58:59,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:58:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:58:59,790 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. 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:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:58:59,835 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2023-02-17 07:58:59,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 07:58:59,835 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:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:58:59,836 INFO L225 Difference]: With dead ends: 25 [2023-02-17 07:58:59,836 INFO L226 Difference]: Without dead ends: 21 [2023-02-17 07:58:59,837 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:59,838 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:58:59,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 07:58:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-17 07:58:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-02-17 07:58:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 07:58:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-17 07:58:59,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2023-02-17 07:58:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:58:59,854 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-17 07:58:59,854 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:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-17 07:58:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 07:58:59,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:58:59,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:58:59,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 07:58:59,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:58:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:58:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash 453332055, now seen corresponding path program 1 times [2023-02-17 07:58:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:58:59,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758705161] [2023-02-17 07:58:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:58:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:58:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:58:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:58:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 07:59:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 07:59:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758705161] [2023-02-17 07:59:00,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758705161] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224131420] [2023-02-17 07:59:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:00,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:00,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:00,075 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:59:00,077 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:59:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 07:59:00,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 07:59:00,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 07:59:00,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224131420] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:00,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:00,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-02-17 07:59:00,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193839497] [2023-02-17 07:59:00,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:00,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 07:59:00,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 07:59:00,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:59:00,269 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-17 07:59:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:00,435 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2023-02-17 07:59:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 07:59:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2023-02-17 07:59:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:00,436 INFO L225 Difference]: With dead ends: 47 [2023-02-17 07:59:00,436 INFO L226 Difference]: Without dead ends: 30 [2023-02-17 07:59:00,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-02-17 07:59:00,438 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:00,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 68 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:59:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-17 07:59:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-17 07:59:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-02-17 07:59:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-02-17 07:59:00,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 24 [2023-02-17 07:59:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:00,444 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-02-17 07:59:00,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-17 07:59:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2023-02-17 07:59:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-17 07:59:00,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:00,455 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:00,461 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:59:00,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:00,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -872442578, now seen corresponding path program 1 times [2023-02-17 07:59:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:00,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580313364] [2023-02-17 07:59:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-02-17 07:59:00,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:00,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580313364] [2023-02-17 07:59:00,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580313364] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:00,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985716710] [2023-02-17 07:59:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:00,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:00,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:00,978 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:59:00,981 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:59:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:01,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 07:59:01,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-02-17 07:59:01,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 07:59:01,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985716710] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:01,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:01,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-02-17 07:59:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149500438] [2023-02-17 07:59:01,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:01,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 07:59:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:01,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 07:59:01,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-02-17 07:59:01,238 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-17 07:59:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:01,403 INFO L93 Difference]: Finished difference Result 74 states and 124 transitions. [2023-02-17 07:59:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 07:59:01,406 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 66 [2023-02-17 07:59:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:01,408 INFO L225 Difference]: With dead ends: 74 [2023-02-17 07:59:01,408 INFO L226 Difference]: Without dead ends: 45 [2023-02-17 07:59:01,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 136 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2023-02-17 07:59:01,425 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:01,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 108 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:59:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-17 07:59:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-17 07:59:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-17 07:59:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2023-02-17 07:59:01,433 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 66 [2023-02-17 07:59:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:01,433 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2023-02-17 07:59:01,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-17 07:59:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2023-02-17 07:59:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-02-17 07:59:01,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:01,437 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:01,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 07:59:01,647 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,SelfDestructingSolverStorable3 [2023-02-17 07:59:01,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1668610484, now seen corresponding path program 2 times [2023-02-17 07:59:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:01,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606175219] [2023-02-17 07:59:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:01,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:59:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 07:59:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:59:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:59:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2023-02-17 07:59:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606175219] [2023-02-17 07:59:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606175219] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590397827] [2023-02-17 07:59:02,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:59:02,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:02,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:02,191 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:59:02,234 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:59:02,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:59:02,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:59:02,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 07:59:02,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2023-02-17 07:59:02,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2023-02-17 07:59:02,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590397827] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:02,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:02,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2023-02-17 07:59:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683416169] [2023-02-17 07:59:02,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:02,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 07:59:02,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 07:59:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-02-17 07:59:02,513 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-02-17 07:59:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:02,810 INFO L93 Difference]: Finished difference Result 116 states and 215 transitions. [2023-02-17 07:59:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-17 07:59:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 172 [2023-02-17 07:59:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:02,812 INFO L225 Difference]: With dead ends: 116 [2023-02-17 07:59:02,812 INFO L226 Difference]: Without dead ends: 73 [2023-02-17 07:59:02,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 381 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2023-02-17 07:59:02,814 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 82 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:02,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 136 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:59:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-17 07:59:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2023-02-17 07:59:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (37), 13 states have call predecessors, (37), 11 states have call successors, (37) [2023-02-17 07:59:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 100 transitions. [2023-02-17 07:59:02,823 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 100 transitions. Word has length 172 [2023-02-17 07:59:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:02,824 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 100 transitions. [2023-02-17 07:59:02,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-02-17 07:59:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 100 transitions. [2023-02-17 07:59:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2023-02-17 07:59:02,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:02,830 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:02,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 07:59:03,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:03,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:03,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:03,038 INFO L85 PathProgramCache]: Analyzing trace with hash 534519633, now seen corresponding path program 3 times [2023-02-17 07:59:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:03,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100405090] [2023-02-17 07:59:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:03,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 07:59:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 924 proven. 2486 refuted. 0 times theorem prover too weak. 8977 trivial. 0 not checked. [2023-02-17 07:59:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:04,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100405090] [2023-02-17 07:59:04,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100405090] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:04,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323958685] [2023-02-17 07:59:04,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:59:04,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:04,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:04,519 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:59:04,521 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:59:04,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2023-02-17 07:59:04,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:59:04,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 07:59:04,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 254 proven. 2070 refuted. 0 times theorem prover too weak. 10063 trivial. 0 not checked. [2023-02-17 07:59:04,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 254 proven. 2127 refuted. 0 times theorem prover too weak. 10006 trivial. 0 not checked. [2023-02-17 07:59:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323958685] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:04,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:04,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 35 [2023-02-17 07:59:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003771741] [2023-02-17 07:59:04,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:04,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-17 07:59:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-17 07:59:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 07:59:04,987 INFO L87 Difference]: Start difference. First operand 63 states and 100 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 25 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (44), 25 states have call predecessors, (44), 25 states have call successors, (44) [2023-02-17 07:59:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:05,465 INFO L93 Difference]: Finished difference Result 187 states and 400 transitions. [2023-02-17 07:59:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-17 07:59:05,465 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 25 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (44), 25 states have call predecessors, (44), 25 states have call successors, (44) Word has length 461 [2023-02-17 07:59:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:05,468 INFO L225 Difference]: With dead ends: 187 [2023-02-17 07:59:05,468 INFO L226 Difference]: Without dead ends: 126 [2023-02-17 07:59:05,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1026 SyntacticMatches, 19 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=830, Invalid=2592, Unknown=0, NotChecked=0, Total=3422 [2023-02-17 07:59:05,471 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:05,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 214 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 07:59:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-17 07:59:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2023-02-17 07:59:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 74 states have internal predecessors, (86), 20 states have call successors, (20), 15 states have call predecessors, (20), 10 states have return successors, (51), 18 states have call predecessors, (51), 20 states have call successors, (51) [2023-02-17 07:59:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2023-02-17 07:59:05,481 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 461 [2023-02-17 07:59:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:05,482 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2023-02-17 07:59:05,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 25 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (44), 25 states have call predecessors, (44), 25 states have call successors, (44) [2023-02-17 07:59:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2023-02-17 07:59:05,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2023-02-17 07:59:05,493 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:05,494 INFO L195 NwaCegarLoop]: trace histogram [119, 119, 96, 59, 59, 59, 59, 59, 59, 59, 37, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:05,502 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:59:05,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:05,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1421420755, now seen corresponding path program 4 times [2023-02-17 07:59:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:05,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64654145] [2023-02-17 07:59:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 07:59:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-17 07:59:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-17 07:59:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 07:59:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-17 07:59:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 4736 proven. 5516 refuted. 0 times theorem prover too weak. 29236 trivial. 0 not checked. [2023-02-17 07:59:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:08,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64654145] [2023-02-17 07:59:08,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64654145] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:08,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584889840] [2023-02-17 07:59:08,686 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 07:59:08,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:08,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:08,687 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:59:08,689 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:59:08,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 07:59:08,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:59:08,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-17 07:59:08,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 3684 proven. 6093 refuted. 0 times theorem prover too weak. 29711 trivial. 0 not checked. [2023-02-17 07:59:09,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 3684 proven. 6240 refuted. 0 times theorem prover too weak. 29564 trivial. 0 not checked. [2023-02-17 07:59:09,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584889840] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:09,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:09,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 35] total 50 [2023-02-17 07:59:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743891168] [2023-02-17 07:59:09,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:09,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-17 07:59:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-17 07:59:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1900, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 07:59:09,774 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 50 states, 50 states have (on average 2.72) internal successors, (136), 50 states have internal predecessors, (136), 45 states have call successors, (49), 1 states have call predecessors, (49), 18 states have return successors, (74), 29 states have call predecessors, (74), 45 states have call successors, (74) [2023-02-17 07:59:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:10,476 INFO L93 Difference]: Finished difference Result 258 states and 509 transitions. [2023-02-17 07:59:10,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-17 07:59:10,477 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.72) internal successors, (136), 50 states have internal predecessors, (136), 45 states have call successors, (49), 1 states have call predecessors, (49), 18 states have return successors, (74), 29 states have call predecessors, (74), 45 states have call successors, (74) Word has length 815 [2023-02-17 07:59:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:10,480 INFO L225 Difference]: With dead ends: 258 [2023-02-17 07:59:10,480 INFO L226 Difference]: Without dead ends: 154 [2023-02-17 07:59:10,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1934 GetRequests, 1808 SyntacticMatches, 47 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1543, Invalid=4937, Unknown=0, NotChecked=0, Total=6480 [2023-02-17 07:59:10,483 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 191 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:10,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 306 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 07:59:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-17 07:59:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2023-02-17 07:59:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.032967032967033) internal successors, (94), 88 states have internal predecessors, (94), 25 states have call successors, (25), 20 states have call predecessors, (25), 10 states have return successors, (64), 18 states have call predecessors, (64), 25 states have call successors, (64) [2023-02-17 07:59:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2023-02-17 07:59:10,492 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 815 [2023-02-17 07:59:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:10,493 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2023-02-17 07:59:10,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.72) internal successors, (136), 50 states have internal predecessors, (136), 45 states have call successors, (49), 1 states have call predecessors, (49), 18 states have return successors, (74), 29 states have call predecessors, (74), 45 states have call successors, (74) [2023-02-17 07:59:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2023-02-17 07:59:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2023-02-17 07:59:10,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:10,504 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:10,510 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:59:10,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:10,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:10,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash -425340118, now seen corresponding path program 5 times [2023-02-17 07:59:10,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:10,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125910676] [2023-02-17 07:59:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:18,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:19,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:19,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 07:59:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-17 07:59:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-17 07:59:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 07:59:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2023-02-17 07:59:21,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:21,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125910676] [2023-02-17 07:59:21,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125910676] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:21,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805037817] [2023-02-17 07:59:21,361 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 07:59:21,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:21,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:21,362 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:59:21,364 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:59:21,757 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 93 check-sat command(s) [2023-02-17 07:59:21,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:59:21,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 220 conjunts are in the unsatisfiable core [2023-02-17 07:59:21,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2023-02-17 07:59:23,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2023-02-17 07:59:42,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805037817] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:42,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:42,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2023-02-17 07:59:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925363092] [2023-02-17 07:59:42,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:42,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 07:59:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 07:59:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 07:59:42,206 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2023-02-17 07:59:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:42,353 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2023-02-17 07:59:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-17 07:59:42,354 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) Word has length 747 [2023-02-17 07:59:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:42,356 INFO L225 Difference]: With dead ends: 128 [2023-02-17 07:59:42,356 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 07:59:42,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1932 GetRequests, 1534 SyntacticMatches, 363 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8728 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 07:59:42,357 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:42,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 339 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:59:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 07:59:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 07:59:42,358 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:59:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 07:59:42,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 747 [2023-02-17 07:59:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:42,358 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 07:59:42,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2023-02-17 07:59:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 07:59:42,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 07:59:42,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 07:59:42,374 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:59:42,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:42,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 07:59:42,574 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2023-02-17 07:59:42,575 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (= |fibonacci_#in~n| fibonacci_~n)) (.cse3 (not (<= (+ fibonacci_~n (- 1)) 0))) (.cse33 (<= fibonacci_~n 2)) (.cse19 (* (- 1) |fibonacci_#in~n|))) (let ((.cse4 (<= .cse19 (- 4))) (.cse8 (<= 3 |fibonacci_#in~n|)) (.cse25 (and .cse1 .cse3 .cse33)) (.cse30 (<= |fibonacci_#in~n| 2)) (.cse32 (< |fibonacci_#in~n| 9)) (.cse17 (<= fibonacci_~n 5))) (let ((.cse18 (not (<= 0 (+ .cse19 5)))) (.cse7 (and .cse1 .cse3)) (.cse2 (<= 0 (+ fibonacci_~n (- 6)))) (.cse5 (not (<= .cse19 (- 6)))) (.cse23 (and .cse1 (or (and .cse1 .cse32 .cse3 .cse33) .cse25 (and .cse1 .cse3 .cse33 (or (and .cse30 .cse1 .cse3 .cse17) (and .cse30 .cse1 .cse32 .cse3 .cse17)))) .cse3 .cse33)) (.cse24 (not (<= 0 (+ .cse19 2)))) (.cse13 (not (<= 0 (+ .cse19 1)))) (.cse6 (not (<= 1 |fibonacci_#in~n|))) (.cse10 (not (<= 0 (+ .cse19 6)))) (.cse14 (<= 0 (+ fibonacci_~n (- 5)))) (.cse11 (<= fibonacci_~n 6)) (.cse15 (not (<= .cse19 (- 5)))) (.cse22 (not (<= 0 (+ .cse19 3)))) (.cse9 (not .cse8)) (.cse21 (<= fibonacci_~n 3)) (.cse26 (<= fibonacci_~n 4)) (.cse16 (not (<= 0 (+ |fibonacci_#in~n| (- 2))))) (.cse0 (not .cse4)) (.cse12 (not .cse32)) (.cse27 (not (<= 0 (+ .cse19 4))))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse6 .cse7) .cse1 (or (and .cse8 .cse1 .cse3) .cse9) (or .cse0 .cse10 .cse5 (and .cse1 .cse2 .cse3 .cse11 .cse4)) (or .cse12 .cse13 (not (<= |fibonacci_#in~n| 0))) (or (and .cse14 .cse1 .cse3) .cse15 .cse16) (or (and .cse14 .cse1 .cse3 .cse17 .cse4) (and (or .cse18 .cse15 .cse16) (or .cse0 .cse18 .cse15)) (and .cse14 .cse1 .cse3 .cse17)) (or .cse0 (and .cse1 .cse3 .cse17 .cse4) .cse18) (or .cse7 .cse16) (or .cse0 (and .cse1 .cse2 .cse3 (<= fibonacci_~n 7) .cse4) (not (<= 0 (+ .cse19 7))) .cse5) (or .cse13 .cse6 (and (or .cse12 .cse13) (or (let ((.cse20 (not (<= |fibonacci_#in~n| 1)))) (and .cse20 (or .cse20 .cse13) (or .cse12 .cse20))) .cse13) .cse13)) (or .cse0 (and .cse1 .cse3 .cse4)) (or (and .cse1 .cse21 .cse3) .cse22 .cse16) (or .cse23 .cse24 .cse25 .cse6) (or (and .cse26 .cse8 .cse1 .cse3) .cse27 .cse9) (or .cse23 (let ((.cse28 (let ((.cse29 (not .cse30))) (and (or .cse12 .cse29) .cse29)))) (and (or (and .cse24 (or .cse24 .cse28) (or .cse12 .cse24)) .cse24 .cse16) (or .cse24 .cse28 .cse16))) .cse25) (or .cse13 .cse6) .cse3 (or .cse10 (and .cse14 .cse1 .cse3 .cse11) .cse15 .cse16) (let ((.cse31 (<= |fibonacci_#in~n| 3))) (or (and (or .cse22 .cse9) (or (and (or .cse22 (not .cse31) .cse16) (or .cse22 .cse12 .cse16)) .cse22 .cse9)) (and .cse8 (or (and .cse1 .cse21 .cse32 .cse3) (and .cse1 .cse31 .cse21 .cse3 .cse17)) .cse1 .cse21 .cse3) (and .cse8 .cse1 .cse21 .cse3))) (or (and .cse26 .cse1 .cse32 .cse3 .cse4) (and .cse26 .cse1 .cse3 .cse4) (and (or .cse0 .cse27 .cse16) (or .cse0 .cse27) (or .cse0 .cse12 .cse27))))))) [2023-02-17 07:59:42,575 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-17 07:59:42,576 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse17 (* (- 1) |fibonacci_#in~n|))) (let ((.cse38 (<= 3 |fibonacci_#in~n|)) (.cse25 (< |fibonacci_#in~n| 9)) (.cse45 (<= .cse17 (- 4)))) (let ((.cse16 (not .cse45)) (.cse50 (not (<= 0 (+ .cse17 5)))) (.cse6 (not (<= .cse17 (- 5)))) (.cse43 (<= 0 (+ fibonacci_~n (- 5)))) (.cse44 (<= |fibonacci_#in~n| 5)) (.cse40 (<= fibonacci_~n 3)) (.cse39 (<= |fibonacci_#in~n| 3)) (.cse21 (not .cse25)) (.cse7 (not (<= 0 (+ |fibonacci_#in~n| (- 2))))) (.cse15 (not (<= 0 (+ .cse17 3)))) (.cse46 (not .cse38)) (.cse41 (<= fibonacci_~n 4)) (.cse36 (<= |fibonacci_#in~n| 4)) (.cse42 (<= fibonacci_~n 6)) (.cse33 (<= 7 |fibonacci_#in~n|)) (.cse34 (<= |fibonacci_#in~n| 7)) (.cse35 (<= fibonacci_~n 7)) (.cse30 (<= fibonacci_~n 8)) (.cse28 (<= 0 (+ fibonacci_~n (- 3)))) (.cse53 (<= 0 (+ |fibonacci_#t~ret4| (- 21)))) (.cse29 (<= 0 (+ fibonacci_~n (- 6)))) (.cse31 (<= 8 |fibonacci_#in~n|)) (.cse32 (<= 0 (+ fibonacci_~n (- 7)))) (.cse23 (<= |fibonacci_#in~n| 2)) (.cse24 (= |fibonacci_#in~n| fibonacci_~n)) (.cse26 (not (<= (+ fibonacci_~n (- 1)) 0))) (.cse27 (<= fibonacci_~n 2)) (.cse37 (<= fibonacci_~n 5)) (.cse52 (<= 0 (+ |fibonacci_#t~ret4| (- 1))))) (let ((.cse0 (not (<= 0 (+ .cse17 2)))) (.cse2 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse37 .cse52)) (.cse3 (not (<= 0 (+ .cse17 6)))) (.cse9 (and .cse28 .cse53 .cse24 .cse29 .cse31 .cse26 .cse32 (<= fibonacci_~n 9))) (.cse11 (and .cse28 .cse53 .cse24 .cse29 .cse31 .cse26 .cse32)) (.cse13 (and .cse28 .cse24 .cse29 .cse30 .cse31 .cse25 .cse26 .cse32 (<= 0 (+ |fibonacci_#t~ret4| (- 13))))) (.cse18 (not (<= .cse17 (- 6)))) (.cse14 (and .cse28 .cse33 (<= 0 (+ |fibonacci_#t~ret4| (- 8))) .cse24 .cse29 .cse34 .cse26 .cse35 .cse32)) (.cse8 (and .cse28 .cse24 .cse29 .cse25 .cse26 .cse42 (<= 0 (+ |fibonacci_#t~ret4| (- 5))))) (.cse47 (not (<= 0 (+ .cse17 4)))) (.cse10 (and .cse28 .cse41 .cse24 (<= 0 (+ |fibonacci_#t~ret4| (- 2))) .cse25 .cse36 .cse26 .cse37 .cse45)) (.cse5 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse37)) (.cse48 (not (<= 0 (+ .cse17 1)))) (.cse1 (not (<= 1 |fibonacci_#in~n|))) (.cse51 (and (or .cse15 .cse46) (or (and (or .cse15 (not .cse39) .cse7) (or .cse15 .cse21 .cse7)) .cse15 .cse46))) (.cse12 (and .cse28 .cse38 .cse24 .cse39 .cse40 .cse26 .cse37 .cse52)) (.cse4 (and .cse28 .cse43 .cse24 .cse44 (<= 0 (+ |fibonacci_#t~ret4| (- 3))) .cse26 .cse37)) (.cse19 (and (or .cse50 .cse6 .cse7) (or .cse16 .cse50 .cse6)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse8) (or .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse7 .cse8) (or .cse9 .cse4 .cse5 .cse11 .cse13 .cse14 .cse6 .cse7 .cse8) (or .cse15 .cse12 .cse2 .cse7) (or .cse16 .cse9 .cse4 .cse10 .cse11 .cse13 .cse14 .cse8) (or .cse16 (not (<= 0 (+ .cse17 7))) .cse18 .cse14 .cse8) (or .cse5 .cse4 .cse19) (or (let ((.cse20 (let ((.cse22 (not .cse23))) (and (or .cse21 .cse22) .cse22)))) (and (or (and .cse0 (or .cse0 .cse20) (or .cse21 .cse0)) .cse0 .cse7) (or .cse0 .cse20 .cse7))) .cse2) (or (and .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse24 .cse29 .cse30 .cse31 .cse25 .cse26 .cse32) (and .cse28 .cse33 .cse24 .cse29 .cse34 .cse26 .cse35 .cse32) (and .cse28 .cse24 .cse25 .cse36 .cse26 .cse37) .cse9 .cse11 .cse12 .cse13 (and .cse28 .cse38 .cse24 .cse39 .cse40 .cse26 .cse37) .cse8 (and .cse24 .cse25 .cse26) (and .cse28 .cse41 .cse24 .cse25 .cse36 .cse26 .cse37) (and .cse28 .cse24 .cse39 .cse40 .cse26 .cse37) (and .cse28 .cse24 .cse29 .cse34 .cse26 .cse35) (and .cse24 .cse39 .cse40 .cse26) (and .cse28 .cse24 .cse29 .cse25 .cse26 .cse42) (and .cse28 .cse24 .cse29 .cse25 .cse26) .cse5 (and .cse28 .cse43 .cse24 .cse44 .cse26 .cse37) (and .cse28 .cse24 .cse44 .cse26 .cse37) .cse14 (and .cse28 .cse41 .cse24 .cse25 .cse36 .cse26 .cse37 .cse45) (and .cse28 .cse24 .cse25 .cse26) .cse4 .cse10 .cse2) (or .cse46 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 .cse8) (or .cse47 .cse46 .cse10 .cse12) (or .cse21 .cse48 (not (<= |fibonacci_#in~n| 0))) (or .cse16 .cse3 .cse18 .cse8) (or .cse16 .cse9 .cse11 .cse13 .cse18 .cse14 .cse8) (or .cse48 .cse1 (and (or .cse21 .cse48) (or (let ((.cse49 (not (<= |fibonacci_#in~n| 1)))) (and .cse49 (or .cse49 .cse48) (or .cse21 .cse49))) .cse48) .cse48)) (or .cse10 (and (or .cse16 .cse47 .cse7) (or .cse16 .cse47) (or .cse16 .cse21 .cse47))) (or .cse16 .cse4 .cse10 .cse50) (or .cse5 .cse51 .cse12) (or .cse48 .cse1) (or .cse51 .cse12) (or .cse4 .cse19)))))) [2023-02-17 07:59:42,576 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2023-02-17 07:59:42,576 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2023-02-17 07:59:42,576 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2023-02-17 07:59:42,576 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-02-17 07:59:42,577 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: (let ((.cse8 (* (- 1) |fibonacci_#in~n|))) (let ((.cse10 (<= 0 (+ |fibonacci_#in~n| (- 2)))) (.cse0 (< |fibonacci_#in~n| 9)) (.cse19 (<= .cse8 (- 4)))) (let ((.cse22 (not .cse19)) (.cse6 (not .cse0)) (.cse14 (not .cse10))) (and (let ((.cse2 (<= |fibonacci_#in~n| 1)) (.cse1 (<= 0 (+ .cse8 1))) (.cse3 (<= 1 |fibonacci_#in~n|))) (or (and (or (and .cse0 .cse1) .cse1 (and (or (and .cse2 .cse0) .cse2 (and .cse2 .cse1)) .cse1)) .cse1 .cse3) (let ((.cse4 (not .cse1)) (.cse5 (not .cse3))) (and (or .cse4 .cse5 (and (or .cse6 .cse4) (or (let ((.cse7 (not .cse2))) (and .cse7 (or .cse7 .cse4) (or .cse6 .cse7))) .cse4) .cse4)) (or .cse4 .cse5))) (and .cse1 .cse3))) (let ((.cse16 (<= |fibonacci_#in~n| 2))) (let ((.cse11 (or .cse16 (and .cse16 .cse0))) (.cse9 (<= 0 (+ .cse8 2)))) (or (and .cse9 .cse10 (or (and .cse11 .cse9) .cse9 (and .cse9 .cse0))) (and .cse11 .cse9 .cse10) (let ((.cse12 (not .cse9)) (.cse13 (let ((.cse15 (not .cse16))) (and (or .cse6 .cse15) .cse15)))) (and (or (and .cse12 (or .cse12 .cse13) (or .cse6 .cse12)) .cse12 .cse14) (or .cse12 .cse13 .cse14)))))) (let ((.cse18 (<= .cse8 (- 5))) (.cse17 (<= 0 (+ .cse8 5)))) (or (and .cse17 .cse18 .cse19) (and .cse17 .cse18 .cse10) (let ((.cse20 (not .cse17)) (.cse21 (not .cse18))) (and (or .cse20 .cse21 .cse14) (or .cse22 .cse20 .cse21))))) (let ((.cse23 (<= 0 (+ .cse8 4)))) (or (and .cse23 .cse19) (and .cse23 .cse10 .cse19) (let ((.cse24 (not .cse23))) (and (or .cse22 .cse24 .cse14) (or .cse22 .cse24) (or .cse22 .cse6 .cse24))) (and .cse23 .cse0 .cse19))) (let ((.cse26 (<= 3 |fibonacci_#in~n|)) (.cse29 (<= |fibonacci_#in~n| 3)) (.cse25 (<= 0 (+ .cse8 3)))) (or (and .cse25 .cse26) (let ((.cse27 (not .cse25)) (.cse28 (not .cse26))) (and (or .cse27 .cse28) (or (and (or .cse27 (not .cse29) .cse14) (or .cse27 .cse6 .cse14)) .cse27 .cse28))) (and .cse25 .cse26 (or (and .cse25 .cse29 .cse10) (and .cse25 .cse0 .cse10))))))))) [2023-02-17 07:59:42,577 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-02-17 07:59:42,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 07:59:42,577 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2023-02-17 07:59:42,577 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 07:59:42,577 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2023-02-17 07:59:42,577 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2023-02-17 07:59:42,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 07:59:42,578 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 38) the Hoare annotation is: true [2023-02-17 07:59:42,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2023-02-17 07:59:42,578 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 07:59:42,578 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2023-02-17 07:59:42,580 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-02-17 07:59:42,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 07:59:42,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 07:59:42 BoogieIcfgContainer [2023-02-17 07:59:42,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 07:59:42,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 07:59:42,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 07:59:42,595 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 07:59:42,595 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:59" (3/4) ... [2023-02-17 07:59:42,598 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 07:59:42,602 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2023-02-17 07:59:42,604 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-17 07:59:42,605 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 07:59:42,605 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 07:59:42,605 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 07:59:42,624 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 07:59:42,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 07:59:42,625 INFO L158 Benchmark]: Toolchain (without parser) took 43846.10ms. Allocated memory was 127.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 85.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. [2023-02-17 07:59:42,625 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory was 96.8MB in the beginning and 96.7MB in the end (delta: 138.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:59:42,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.13ms. Allocated memory is still 127.9MB. Free memory was 84.8MB in the beginning and 75.0MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:59:42,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.64ms. Allocated memory is still 127.9MB. Free memory was 75.0MB in the beginning and 73.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:59:42,626 INFO L158 Benchmark]: Boogie Preprocessor took 24.99ms. Allocated memory is still 127.9MB. Free memory was 73.6MB in the beginning and 72.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:59:42,626 INFO L158 Benchmark]: RCFGBuilder took 246.61ms. Allocated memory is still 127.9MB. Free memory was 72.5MB in the beginning and 63.5MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:59:42,626 INFO L158 Benchmark]: TraceAbstraction took 43350.36ms. Allocated memory was 127.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 62.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 182.6MB. Max. memory is 16.1GB. [2023-02-17 07:59:42,626 INFO L158 Benchmark]: Witness Printer took 29.85ms. Allocated memory is still 1.8GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:59:42,627 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.18ms. Allocated memory is still 127.9MB. Free memory was 96.8MB in the beginning and 96.7MB in the end (delta: 138.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.13ms. Allocated memory is still 127.9MB. Free memory was 84.8MB in the beginning and 75.0MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.64ms. Allocated memory is still 127.9MB. Free memory was 75.0MB in the beginning and 73.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.99ms. Allocated memory is still 127.9MB. Free memory was 73.6MB in the beginning and 72.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 246.61ms. Allocated memory is still 127.9MB. Free memory was 72.5MB in the beginning and 63.5MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 43350.36ms. Allocated memory was 127.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 62.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 182.6MB. Max. memory is 16.1GB. * Witness Printer took 29.85ms. Allocated memory is still 1.8GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.3s, OverallIterations: 8, TraceHistogramMax: 119, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 498 mSDsluCounter, 1258 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1057 mSDsCounter, 1220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2356 IncrementalHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1220 mSolverCounterUnsat, 201 mSDtfsCounter, 2356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5645 GetRequests, 4938 SyntacticMatches, 449 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13406 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=7, InterpolantAutomatonStates: 179, 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, 8 MinimizatonAttempts, 57 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 200 PreInvPairs, 301 NumberOfFragments, 5264 HoareAnnotationTreeSize, 200 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 38.2s InterpolantComputationTime, 4593 NumberOfCodeBlocks, 4268 NumberOfCodeBlocksAsserted, 134 NumberOfCheckSat, 6858 ConstructedInterpolants, 0 QuantifiedInterpolants, 15111 SizeOfPredicates, 44 NumberOfNonLiveVariables, 4372 ConjunctsInSsa, 296 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 219410/260316 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:59:42,645 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