./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/recursified_loop-simple/recursified_nested_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:59:25,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:59:25,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:59:25,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:59:25,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:59:25,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:59:25,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:59:25,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:59:25,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:59:25,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:59:25,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:59:25,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:59:25,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:59:25,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:59:25,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:59:25,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:59:25,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:59:25,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:59:25,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:59:25,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:59:25,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:59:25,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:59:25,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:59:25,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:59:25,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:59:25,583 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:59:25,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:59:25,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:59:25,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:59:25,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:59:25,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:59:25,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:59:25,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:59:25,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:59:25,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:59:25,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:59:25,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:59:25,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:59:25,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:59:25,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:59:25,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:59:25,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:59:25,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:59:25,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:59:25,590 INFO L153 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 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 ! overflow) ) 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2024-11-17 04:59:25,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:59:25,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:59:25,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:59:25,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:59:25,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:59:25,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-11-17 04:59:27,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:59:27,336 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:59:27,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-11-17 04:59:27,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22502c33/44d2ad61c7104d59abfa42054a294925/FLAG02a38275d [2024-11-17 04:59:27,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22502c33/44d2ad61c7104d59abfa42054a294925 [2024-11-17 04:59:27,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:59:27,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:59:27,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:59:27,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:59:27,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:59:27,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:27,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45050d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27, skipping insertion in model container [2024-11-17 04:59:27,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:27,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:59:27,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:59:27,925 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:59:27,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:59:27,949 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:59:27,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27 WrapperNode [2024-11-17 04:59:27,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:59:27,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:59:27,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:59:27,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:59:27,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:27,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:27,979 INFO L138 Inliner]: procedures = 13, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-11-17 04:59:27,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:59:27,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:59:27,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:59:27,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:59:27,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:27,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:27,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:27,999 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-11-17 04:59:27,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:27,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:28,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:28,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:28,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:28,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:28,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:59:28,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:59:28,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:59:28,007 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:59:28,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (1/1) ... [2024-11-17 04:59:28,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:59:28,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:28,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 04:59:28,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 04:59:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:59:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:59:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 04:59:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 04:59:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 04:59:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 04:59:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 04:59:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 04:59:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-11-17 04:59:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-11-17 04:59:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:59:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:59:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 04:59:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 04:59:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 04:59:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-11-17 04:59:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-11-17 04:59:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 04:59:28,156 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:59:28,157 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:59:28,320 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset; [2024-11-17 04:59:28,389 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-17 04:59:28,389 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:59:28,398 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:59:28,398 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:59:28,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:59:28 BoogieIcfgContainer [2024-11-17 04:59:28,398 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:59:28,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:59:28,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:59:28,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:59:28,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:59:27" (1/3) ... [2024-11-17 04:59:28,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5273ca2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:59:28, skipping insertion in model container [2024-11-17 04:59:28,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:27" (2/3) ... [2024-11-17 04:59:28,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5273ca2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:59:28, skipping insertion in model container [2024-11-17 04:59:28,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:59:28" (3/3) ... [2024-11-17 04:59:28,404 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-11-17 04:59:28,416 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:59:28,416 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-17 04:59:28,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:59:28,461 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@40af6330, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:59:28,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 04:59:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 28 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 04:59:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 04:59:28,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:28,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:28,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-17 04:59:28,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2055528607, now seen corresponding path program 1 times [2024-11-17 04:59:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:28,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610857367] [2024-11-17 04:59:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:28,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:59:28,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:28,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610857367] [2024-11-17 04:59:28,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610857367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:28,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:28,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 04:59:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147741148] [2024-11-17 04:59:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:28,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:59:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:28,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:59:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:59:28,872 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 28 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:28,959 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2024-11-17 04:59:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:59:28,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 04:59:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:28,966 INFO L225 Difference]: With dead ends: 68 [2024-11-17 04:59:28,966 INFO L226 Difference]: Without dead ends: 29 [2024-11-17 04:59:28,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:59:28,970 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:28,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:59:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-17 04:59:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-17 04:59:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:59:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-17 04:59:28,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2024-11-17 04:59:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:28,996 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-17 04:59:28,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-17 04:59:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 04:59:28,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:28,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:28,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:59:28,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-17 04:59:28,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash 703122621, now seen corresponding path program 1 times [2024-11-17 04:59:28,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:28,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446312928] [2024-11-17 04:59:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:59:29,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446312928] [2024-11-17 04:59:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446312928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:29,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:59:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969033164] [2024-11-17 04:59:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:29,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:59:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:59:29,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:59:29,050 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:29,065 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-17 04:59:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:59:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 04:59:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:29,067 INFO L225 Difference]: With dead ends: 26 [2024-11-17 04:59:29,067 INFO L226 Difference]: Without dead ends: 25 [2024-11-17 04:59:29,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:59:29,068 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:29,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:59:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-17 04:59:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-17 04:59:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:59:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-17 04:59:29,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2024-11-17 04:59:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:29,072 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-17 04:59:29,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-17 04:59:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 04:59:29,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:29,073 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:29,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:59:29,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-17 04:59:29,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:29,074 INFO L85 PathProgramCache]: Analyzing trace with hash 638967446, now seen corresponding path program 1 times [2024-11-17 04:59:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598718790] [2024-11-17 04:59:29,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:29,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:59:29,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:29,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598718790] [2024-11-17 04:59:29,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598718790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:29,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:29,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:59:29,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213305156] [2024-11-17 04:59:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:29,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:59:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:29,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:59:29,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:59:29,230 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:29,365 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-17 04:59:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 04:59:29,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 04:59:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:29,368 INFO L225 Difference]: With dead ends: 32 [2024-11-17 04:59:29,368 INFO L226 Difference]: Without dead ends: 31 [2024-11-17 04:59:29,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:59:29,370 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:29,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:59:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-17 04:59:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-11-17 04:59:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:59:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-17 04:59:29,383 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2024-11-17 04:59:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:29,384 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-17 04:59:29,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-17 04:59:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 04:59:29,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:29,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:29,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 04:59:29,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-17 04:59:29,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1896078261, now seen corresponding path program 1 times [2024-11-17 04:59:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:29,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069432413] [2024-11-17 04:59:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 04:59:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069432413] [2024-11-17 04:59:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069432413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:59:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348980919] [2024-11-17 04:59:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:29,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:59:29,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:29,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:59:29,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:59:29,575 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:59:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:29,693 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-17 04:59:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 04:59:29,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-17 04:59:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:29,695 INFO L225 Difference]: With dead ends: 34 [2024-11-17 04:59:29,695 INFO L226 Difference]: Without dead ends: 32 [2024-11-17 04:59:29,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-17 04:59:29,696 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:29,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 66 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:59:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-17 04:59:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-17 04:59:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:59:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-17 04:59:29,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2024-11-17 04:59:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:29,711 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-17 04:59:29,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:59:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-17 04:59:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 04:59:29,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:29,712 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:29,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:59:29,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-17 04:59:29,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1152091308, now seen corresponding path program 1 times [2024-11-17 04:59:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:29,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089488745] [2024-11-17 04:59:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:29,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 04:59:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 04:59:30,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089488745] [2024-11-17 04:59:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089488745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:59:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455832783] [2024-11-17 04:59:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:30,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:30,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:30,234 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) [2024-11-17 04:59:30,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 04:59:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-17 04:59:30,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:59:30,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 04:59:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-17 04:59:30,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:59:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 04:59:30,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455832783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:59:30,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:59:30,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2024-11-17 04:59:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921559705] [2024-11-17 04:59:30,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:59:30,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 04:59:30,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:30,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 04:59:30,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2024-11-17 04:59:30,962 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 24 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-17 04:59:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:31,152 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2024-11-17 04:59:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 04:59:31,153 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 40 [2024-11-17 04:59:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:31,153 INFO L225 Difference]: With dead ends: 60 [2024-11-17 04:59:31,154 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 04:59:31,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2024-11-17 04:59:31,155 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:31,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:59:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 04:59:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 04:59:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 04:59:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-17 04:59:31,161 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 40 [2024-11-17 04:59:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:31,162 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-17 04:59:31,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-17 04:59:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-17 04:59:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 04:59:31,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:31,164 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:31,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 04:59:31,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:31,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-17 04:59:31,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1672315016, now seen corresponding path program 2 times [2024-11-17 04:59:31,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:31,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890185260] [2024-11-17 04:59:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-17 04:59:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-17 04:59:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890185260] [2024-11-17 04:59:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890185260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:59:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838915669] [2024-11-17 04:59:31,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 04:59:31,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:31,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:31,625 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) [2024-11-17 04:59:31,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 04:59:31,694 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 04:59:31,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:59:31,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-17 04:59:31,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:59:31,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 04:59:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 103 proven. 15 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-17 04:59:32,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:59:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 3 proven. 136 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 04:59:33,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838915669] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:59:33,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:59:33,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 21] total 38 [2024-11-17 04:59:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313744395] [2024-11-17 04:59:33,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:59:33,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-17 04:59:33,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-17 04:59:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2024-11-17 04:59:33,351 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 38 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 11 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-17 04:59:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:33,854 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-17 04:59:33,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 04:59:33,856 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 11 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) Word has length 72 [2024-11-17 04:59:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:33,856 INFO L225 Difference]: With dead ends: 67 [2024-11-17 04:59:33,857 INFO L226 Difference]: Without dead ends: 38 [2024-11-17 04:59:33,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=365, Invalid=2185, Unknown=0, NotChecked=0, Total=2550 [2024-11-17 04:59:33,859 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:33,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 73 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 04:59:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-17 04:59:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-17 04:59:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-17 04:59:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-17 04:59:33,864 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 72 [2024-11-17 04:59:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:33,865 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-17 04:59:33,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 11 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-17 04:59:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-17 04:59:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 04:59:33,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:33,867 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:33,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 04:59:34,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-17 04:59:34,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-17 04:59:34,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 644266758, now seen corresponding path program 1 times [2024-11-17 04:59:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857084229] [2024-11-17 04:59:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-17 04:59:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-17 04:59:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857084229] [2024-11-17 04:59:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857084229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:59:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422528891] [2024-11-17 04:59:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:34,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:34,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:34,362 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) [2024-11-17 04:59:34,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 04:59:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 04:59:34,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:59:34,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 04:59:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-17 04:59:34,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:59:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422528891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:34,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:59:34,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-17 04:59:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232762714] [2024-11-17 04:59:34,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:34,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:59:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:34,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:59:34,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-17 04:59:34,599 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:59:38,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 04:59:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:38,660 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-17 04:59:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 04:59:38,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 89 [2024-11-17 04:59:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:38,660 INFO L225 Difference]: With dead ends: 36 [2024-11-17 04:59:38,660 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 04:59:38,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-17 04:59:38,661 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:38,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2024-11-17 04:59:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 04:59:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 04:59:38,662 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) [2024-11-17 04:59:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 04:59:38,662 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2024-11-17 04:59:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:38,662 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 04:59:38,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:59:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 04:59:38,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 04:59:38,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-17 04:59:38,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-17 04:59:38,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-17 04:59:38,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-17 04:59:38,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 04:59:38,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:38,868 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-17 04:59:38,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-17 04:59:43,238 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 04:59:43,248 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (let ((.cse3 (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|))) (let ((.cse0 (= .cse3 0)) (.cse1 (select (select |#memory_int#2| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|)) (.cse2 (= |#memory_int#1| |old(#memory_int#1)|))) (and (or (not .cse0) (and (= .cse1 0) .cse2)) (or .cse0 (<= 1 .cse3)) (or (and (<= 1 .cse1) .cse2) (< .cse3 1))))) Eliminated clause: (exists ((|old(#memory_int#1)| (Array Int (Array Int Int))) (|old(#memory_int#2)| (Array Int (Array Int Int)))) (let ((.cse3 (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|))) (let ((.cse0 (= .cse3 0)) (.cse1 (select (select |#memory_int#2| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|)) (.cse2 (= |#memory_int#1| |old(#memory_int#1)|))) (and (or (not .cse0) (and (= .cse1 0) .cse2)) (or .cse0 (< 0 .cse3)) (or (and (<= 1 .cse1) .cse2) (< .cse3 1)))))) [2024-11-17 04:59:43,252 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 04:59:43,254 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 04:59:43,254 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-17 04:59:43,254 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-11-17 04:59:43,256 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 04:59:43,256 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-17 04:59:43,256 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-11-17 04:59:43,259 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (and (<= 0 (+ (select (select |old(#memory_int#1)| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|) 2147483648)) (= |#memory_int#1| |old(#memory_int#1)|) (exists ((v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_1 Int)) (<= (select (select |#memory_int#2| v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_1) v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_1) 5))) Eliminated clause: (and (<= 0 (+ (select (select |#memory_int#1| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|) 2147483648)) (exists ((v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_1 Int)) (<= (select (select |#memory_int#2| v_func_to_recursive_line_20_to_21_0_~a.base_BEFORE_CALL_1) v_func_to_recursive_line_20_to_21_0_~a.offset_BEFORE_CALL_1) 5))) [2024-11-17 04:59:43,261 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:59:43,263 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 04:59:43,263 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-17 04:59:43,263 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 04:59:43,263 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 04:59:43,263 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-17 04:59:43,263 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-17 04:59:43,263 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 04:59:43,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:59:43 BoogieIcfgContainer [2024-11-17 04:59:43,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 04:59:43,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 04:59:43,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 04:59:43,265 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 04:59:43,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:59:28" (3/4) ... [2024-11-17 04:59:43,268 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 04:59:43,270 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2024-11-17 04:59:43,271 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2024-11-17 04:59:43,274 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-17 04:59:43,274 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-17 04:59:43,275 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 04:59:43,275 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 04:59:43,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 04:59:43,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 04:59:43,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 04:59:43,342 INFO L158 Benchmark]: Toolchain (without parser) took 15590.81ms. Allocated memory was 211.8MB in the beginning and 291.5MB in the end (delta: 79.7MB). Free memory was 143.0MB in the beginning and 113.3MB in the end (delta: 29.8MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2024-11-17 04:59:43,342 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 104.2MB in the beginning and 104.2MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 04:59:43,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.74ms. Allocated memory is still 211.8MB. Free memory was 142.8MB in the beginning and 130.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 04:59:43,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.33ms. Allocated memory is still 211.8MB. Free memory was 130.9MB in the beginning and 129.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:59:43,342 INFO L158 Benchmark]: Boogie Preprocessor took 26.05ms. Allocated memory is still 211.8MB. Free memory was 129.3MB in the beginning and 127.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 04:59:43,343 INFO L158 Benchmark]: IcfgBuilder took 391.58ms. Allocated memory is still 211.8MB. Free memory was 127.5MB in the beginning and 179.8MB in the end (delta: -52.3MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-17 04:59:43,343 INFO L158 Benchmark]: TraceAbstraction took 14864.15ms. Allocated memory was 211.8MB in the beginning and 291.5MB in the end (delta: 79.7MB). Free memory was 178.5MB in the beginning and 118.5MB in the end (delta: 60.0MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. [2024-11-17 04:59:43,343 INFO L158 Benchmark]: Witness Printer took 77.22ms. Allocated memory is still 291.5MB. Free memory was 118.5MB in the beginning and 113.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 04:59:43,344 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 104.2MB in the beginning and 104.2MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.74ms. Allocated memory is still 211.8MB. Free memory was 142.8MB in the beginning and 130.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.33ms. Allocated memory is still 211.8MB. Free memory was 130.9MB in the beginning and 129.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.05ms. Allocated memory is still 211.8MB. Free memory was 129.3MB in the beginning and 127.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 391.58ms. Allocated memory is still 211.8MB. Free memory was 127.5MB in the beginning and 179.8MB in the end (delta: -52.3MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14864.15ms. Allocated memory was 211.8MB in the beginning and 291.5MB in the end (delta: 79.7MB). Free memory was 178.5MB in the beginning and 118.5MB in the end (delta: 60.0MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. * Witness Printer took 77.22ms. Allocated memory is still 291.5MB. Free memory was 118.5MB in the beginning and 113.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 592 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 470 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 840 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 122 mSDtfsCounter, 840 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 556 ConstructedInterpolants, 36 QuantifiedInterpolants, 2426 SizeOfPredicates, 15 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 1045/1233 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-17 04:59:43,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE