./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:07:04,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:07:04,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 19:07:04,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:07:04,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:07:04,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:07:04,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:07:04,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:07:04,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:07:04,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:07:04,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:07:04,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:07:04,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:07:04,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:07:04,324 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:07:04,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:07:04,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:07:04,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 19:07:04,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 19:07:04,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 19:07:04,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:07:04,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:07:04,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:07:04,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:07:04,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:07:04,328 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:07:04,329 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:07:04,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 19:07:04,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:07:04,330 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:07:04,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:07:04,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:07:04,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:07:04,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:07:04,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:07:04,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:07:04,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:07:04,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:07:04,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 19:07:04,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 19:07:04,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:07:04,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:07:04,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:07:04,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:07:04,335 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2024-11-20 19:07:04,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:07:04,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:07:04,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:07:04,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:07:04,613 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:07:04,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-20 19:07:06,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:07:06,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:07:06,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-20 19:07:06,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c95b4ef/a3a6d9422ce44ad285be327cc053d9a8/FLAG7e66cb255 [2024-11-20 19:07:06,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c95b4ef/a3a6d9422ce44ad285be327cc053d9a8 [2024-11-20 19:07:06,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:07:06,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:07:06,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:07:06,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:07:06,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:07:06,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4385ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06, skipping insertion in model container [2024-11-20 19:07:06,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:07:06,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:07:06,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:07:06,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:07:06,894 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:07:06,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06 WrapperNode [2024-11-20 19:07:06,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:07:06,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:07:06,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:07:06,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:07:06,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,932 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-11-20 19:07:06,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:07:06,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:07:06,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:07:06,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:07:06,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,969 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2024-11-20 19:07:06,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:06,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:07:06,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:07:06,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:07:06,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:07:06,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (1/1) ... [2024-11-20 19:07:07,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:07:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:07:07,028 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-20 19:07:07,031 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-20 19:07:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:07:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 19:07:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 19:07:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 19:07:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 19:07:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 19:07:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 19:07:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 19:07:07,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 19:07:07,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 19:07:07,089 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-11-20 19:07:07,089 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-11-20 19:07:07,089 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-20 19:07:07,089 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-20 19:07:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:07:07,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:07:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 19:07:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 19:07:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 19:07:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 19:07:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-11-20 19:07:07,092 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-11-20 19:07:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 19:07:07,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:07:07,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:07:07,390 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 19:07:07,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:07:07,410 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:07:07,410 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 19:07:07,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:07:07 BoogieIcfgContainer [2024-11-20 19:07:07,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:07:07,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:07:07,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:07:07,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:07:07,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:07:06" (1/3) ... [2024-11-20 19:07:07,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3e8b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:07:07, skipping insertion in model container [2024-11-20 19:07:07,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:07:06" (2/3) ... [2024-11-20 19:07:07,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3e8b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:07:07, skipping insertion in model container [2024-11-20 19:07:07,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:07:07" (3/3) ... [2024-11-20 19:07:07,424 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2024-11-20 19:07:07,438 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:07:07,439 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-20 19:07:07,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:07:07,502 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;@4250e984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:07:07,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-20 19:07:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 19:07:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 19:07:07,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:07,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:07,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -946069669, now seen corresponding path program 1 times [2024-11-20 19:07:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:07,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583773632] [2024-11-20 19:07:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:08,157 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-20 19:07:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583773632] [2024-11-20 19:07:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583773632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:08,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:07:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 19:07:08,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107763774] [2024-11-20 19:07:08,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:08,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:07:08,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:08,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:07:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 19:07:08,190 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-20 19:07:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:08,298 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-11-20 19:07:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:07:08,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2024-11-20 19:07:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:08,308 INFO L225 Difference]: With dead ends: 89 [2024-11-20 19:07:08,309 INFO L226 Difference]: Without dead ends: 37 [2024-11-20 19:07:08,312 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-20 19:07:08,315 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:08,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 210 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:07:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-20 19:07:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-20 19:07:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.380952380952381) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-20 19:07:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-20 19:07:08,354 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 12 [2024-11-20 19:07:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:08,354 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-20 19:07:08,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-20 19:07:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-20 19:07:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 19:07:08,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:08,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:08,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 19:07:08,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:08,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 736611370, now seen corresponding path program 1 times [2024-11-20 19:07:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:08,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912360845] [2024-11-20 19:07:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:08,472 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-20 19:07:08,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912360845] [2024-11-20 19:07:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912360845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:08,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:07:08,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 19:07:08,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104833492] [2024-11-20 19:07:08,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:08,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:07:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:07:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:07:08,480 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 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-20 19:07:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:08,509 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-20 19:07:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:07:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 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 13 [2024-11-20 19:07:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:08,511 INFO L225 Difference]: With dead ends: 35 [2024-11-20 19:07:08,511 INFO L226 Difference]: Without dead ends: 34 [2024-11-20 19:07:08,511 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-20 19:07:08,512 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:08,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:07:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-20 19:07:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-20 19:07:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-20 19:07:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-20 19:07:08,521 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 13 [2024-11-20 19:07:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:08,522 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-20 19:07:08,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 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-20 19:07:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-20 19:07:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 19:07:08,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:08,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:08,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 19:07:08,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:08,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash -939107226, now seen corresponding path program 1 times [2024-11-20 19:07:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:08,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442664992] [2024-11-20 19:07:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 19:07:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:08,793 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-20 19:07:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442664992] [2024-11-20 19:07:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442664992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:08,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:07:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 19:07:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002376285] [2024-11-20 19:07:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:08,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:07:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:08,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:07:08,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 19:07:08,799 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:07:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:08,954 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-11-20 19:07:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:07:08,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-20 19:07:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:08,959 INFO L225 Difference]: With dead ends: 69 [2024-11-20 19:07:08,959 INFO L226 Difference]: Without dead ends: 38 [2024-11-20 19:07:08,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-20 19:07:08,961 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:08,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:07:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-20 19:07:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-20 19:07:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-20 19:07:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-20 19:07:08,971 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 12 [2024-11-20 19:07:08,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:08,971 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-20 19:07:08,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:07:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-20 19:07:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 19:07:08,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:08,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:08,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 19:07:08,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:08,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash 497085987, now seen corresponding path program 1 times [2024-11-20 19:07:08,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:08,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191054248] [2024-11-20 19:07:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:08,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,181 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-20 19:07:09,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:09,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191054248] [2024-11-20 19:07:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191054248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:09,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:07:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 19:07:09,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962891384] [2024-11-20 19:07:09,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:09,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 19:07:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 19:07:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 19:07:09,183 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 19:07:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:09,282 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-20 19:07:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 19:07:09,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 19:07:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:09,285 INFO L225 Difference]: With dead ends: 42 [2024-11-20 19:07:09,285 INFO L226 Difference]: Without dead ends: 41 [2024-11-20 19:07:09,286 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-20 19:07:09,287 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:09,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:07:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-20 19:07:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2024-11-20 19:07:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-20 19:07:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-20 19:07:09,303 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2024-11-20 19:07:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:09,304 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-20 19:07:09,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 19:07:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-20 19:07:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 19:07:09,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:09,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:09,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 19:07:09,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:09,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1200173767, now seen corresponding path program 1 times [2024-11-20 19:07:09,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:09,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835523436] [2024-11-20 19:07:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 19:07:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,482 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-20 19:07:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835523436] [2024-11-20 19:07:09,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835523436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:09,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:07:09,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 19:07:09,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213817124] [2024-11-20 19:07:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:09,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 19:07:09,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 19:07:09,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 19:07:09,488 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 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-20 19:07:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:09,609 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-11-20 19:07:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 19:07:09,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 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) Word has length 22 [2024-11-20 19:07:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:09,611 INFO L225 Difference]: With dead ends: 46 [2024-11-20 19:07:09,611 INFO L226 Difference]: Without dead ends: 42 [2024-11-20 19:07:09,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-20 19:07:09,613 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:09,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 125 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:07:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-20 19:07:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-20 19:07:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-20 19:07:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-20 19:07:09,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 22 [2024-11-20 19:07:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:09,621 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-20 19:07:09,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 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-20 19:07:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-20 19:07:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 19:07:09,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:09,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 19:07:09,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1746536758, now seen corresponding path program 1 times [2024-11-20 19:07:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062350456] [2024-11-20 19:07:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 19:07:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:07:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 19:07:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 19:07:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062350456] [2024-11-20 19:07:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062350456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:09,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:07:09,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 19:07:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938536820] [2024-11-20 19:07:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:09,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 19:07:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:09,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 19:07:09,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 19:07:09,816 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 19:07:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:09,973 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-20 19:07:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 19:07:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-20 19:07:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:09,975 INFO L225 Difference]: With dead ends: 50 [2024-11-20 19:07:09,975 INFO L226 Difference]: Without dead ends: 48 [2024-11-20 19:07:09,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-20 19:07:09,976 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:09,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 109 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:07:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-20 19:07:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-20 19:07:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-20 19:07:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-20 19:07:09,991 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 32 [2024-11-20 19:07:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:09,991 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-20 19:07:09,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 19:07:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-20 19:07:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-20 19:07:09,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:09,992 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:09,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 19:07:09,993 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:09,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1339769860, now seen corresponding path program 1 times [2024-11-20 19:07:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169782268] [2024-11-20 19:07:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 19:07:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:10,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:07:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:10,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 19:07:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169782268] [2024-11-20 19:07:10,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169782268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:07:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243871355] [2024-11-20 19:07:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:10,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:10,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:07:10,519 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-20 19:07:10,520 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-20 19:07:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:10,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-20 19:07:10,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:07:10,708 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-20 19:07:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 19:07:10,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:07:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 19:07:11,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243871355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:07:11,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:07:11,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2024-11-20 19:07:11,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137944381] [2024-11-20 19:07:11,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:07:11,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 19:07:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:11,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 19:07:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2024-11-20 19:07:11,471 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 24 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 7 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-20 19:07:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:11,739 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2024-11-20 19:07:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 19:07:11,741 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 7 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 40 [2024-11-20 19:07:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:11,742 INFO L225 Difference]: With dead ends: 94 [2024-11-20 19:07:11,742 INFO L226 Difference]: Without dead ends: 52 [2024-11-20 19:07:11,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2024-11-20 19:07:11,743 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:11,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 260 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:07:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-20 19:07:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-20 19:07:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-20 19:07:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-20 19:07:11,759 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 40 [2024-11-20 19:07:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:11,760 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-20 19:07:11,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 7 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-20 19:07:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-20 19:07:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 19:07:11,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:11,764 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:11,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 19:07:11,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:11,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:11,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1798826692, now seen corresponding path program 2 times [2024-11-20 19:07:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:11,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266815137] [2024-11-20 19:07:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 19:07:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:12,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 19:07:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:12,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 11 proven. 90 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-20 19:07:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266815137] [2024-11-20 19:07:13,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266815137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:07:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286695830] [2024-11-20 19:07:13,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 19:07:13,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:13,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:07:13,015 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-20 19:07:13,017 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-20 19:07:13,127 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 19:07:13,128 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 19:07:13,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 19:07:13,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:07:13,173 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 15 treesize of output 1 [2024-11-20 19:07:13,381 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 17 treesize of output 9 [2024-11-20 19:07:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-20 19:07:13,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:07:13,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286695830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:13,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:07:13,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2024-11-20 19:07:13,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047003598] [2024-11-20 19:07:13,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:13,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 19:07:13,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:13,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 19:07:13,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-20 19:07:13,409 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 19:07:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:13,539 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-20 19:07:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 19:07:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 68 [2024-11-20 19:07:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:13,541 INFO L225 Difference]: With dead ends: 55 [2024-11-20 19:07:13,541 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 19:07:13,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-11-20 19:07:13,545 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:13,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 90 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:07:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 19:07:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-11-20 19:07:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-20 19:07:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-20 19:07:13,558 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 68 [2024-11-20 19:07:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:13,558 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-20 19:07:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 19:07:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-20 19:07:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 19:07:13,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:13,560 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:13,569 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-20 19:07:13,764 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,SelfDestructingSolverStorable7 [2024-11-20 19:07:13,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash 70947448, now seen corresponding path program 1 times [2024-11-20 19:07:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:13,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463945145] [2024-11-20 19:07:13,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:13,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 19:07:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 19:07:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-20 19:07:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463945145] [2024-11-20 19:07:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463945145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:07:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478171449] [2024-11-20 19:07:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:14,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:07:14,140 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-20 19:07:14,143 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-20 19:07:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:07:14,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:07:14,403 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-20 19:07:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-20 19:07:14,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:07:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478171449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:07:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-20 19:07:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898176628] [2024-11-20 19:07:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:14,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:07:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:07:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-20 19:07:14,421 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 19:07:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:14,496 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-20 19:07:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 19:07:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 69 [2024-11-20 19:07:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:14,497 INFO L225 Difference]: With dead ends: 51 [2024-11-20 19:07:14,497 INFO L226 Difference]: Without dead ends: 50 [2024-11-20 19:07:14,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 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-20 19:07:14,498 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:14,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:07:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-20 19:07:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-11-20 19:07:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-20 19:07:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-11-20 19:07:14,505 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 69 [2024-11-20 19:07:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:14,505 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-11-20 19:07:14,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 19:07:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-11-20 19:07:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 19:07:14,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:14,507 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:14,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 19:07:14,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:14,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:14,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1670048421, now seen corresponding path program 1 times [2024-11-20 19:07:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:14,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477118730] [2024-11-20 19:07:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:14,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 19:07:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:07:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 19:07:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 19:07:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:07:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 19:07:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 13 proven. 99 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-20 19:07:15,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:15,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477118730] [2024-11-20 19:07:15,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477118730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:07:15,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062366823] [2024-11-20 19:07:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:15,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:15,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:07:15,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:07:15,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 19:07:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:15,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-20 19:07:15,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:07:15,858 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-20 19:07:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-20 19:07:16,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:07:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 104 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-20 19:07:18,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062366823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:07:18,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:07:18,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 21] total 40 [2024-11-20 19:07:18,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887979948] [2024-11-20 19:07:18,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:07:18,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-20 19:07:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-20 19:07:18,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2024-11-20 19:07:18,144 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 40 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 34 states have internal predecessors, (75), 11 states have call successors, (23), 8 states have call predecessors, (23), 11 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-20 19:07:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:18,541 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2024-11-20 19:07:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 19:07:18,541 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 34 states have internal predecessors, (75), 11 states have call successors, (23), 8 states have call predecessors, (23), 11 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) Word has length 91 [2024-11-20 19:07:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:18,542 INFO L225 Difference]: With dead ends: 90 [2024-11-20 19:07:18,542 INFO L226 Difference]: Without dead ends: 50 [2024-11-20 19:07:18,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 178 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2024-11-20 19:07:18,544 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:18,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 297 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 19:07:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-20 19:07:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-20 19:07:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-20 19:07:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-20 19:07:18,559 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 91 [2024-11-20 19:07:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:18,559 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-20 19:07:18,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 34 states have internal predecessors, (75), 11 states have call successors, (23), 8 states have call predecessors, (23), 11 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-20 19:07:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-20 19:07:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 19:07:18,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:18,565 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 10, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:18,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 19:07:18,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:18,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1069960219, now seen corresponding path program 2 times [2024-11-20 19:07:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790983966] [2024-11-20 19:07:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 19:07:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:19,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:07:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:19,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:07:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 19:07:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:07:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:07:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 21 proven. 227 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-20 19:07:20,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790983966] [2024-11-20 19:07:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790983966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:07:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559937827] [2024-11-20 19:07:20,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 19:07:20,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:20,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:07:20,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:07:20,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 19:07:20,616 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 19:07:20,616 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 19:07:20,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 19:07:20,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:07:20,653 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 15 treesize of output 1 [2024-11-20 19:07:20,869 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 17 treesize of output 9 [2024-11-20 19:07:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-20 19:07:20,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:07:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559937827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:20,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:07:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 24 [2024-11-20 19:07:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682201179] [2024-11-20 19:07:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:20,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 19:07:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 19:07:20,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2024-11-20 19:07:20,891 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 19:07:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:20,986 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-11-20 19:07:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 19:07:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 119 [2024-11-20 19:07:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:20,987 INFO L225 Difference]: With dead ends: 51 [2024-11-20 19:07:20,987 INFO L226 Difference]: Without dead ends: 50 [2024-11-20 19:07:20,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2024-11-20 19:07:20,988 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:20,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:07:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-20 19:07:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-20 19:07:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-20 19:07:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-11-20 19:07:20,997 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 119 [2024-11-20 19:07:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:20,997 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-20 19:07:20,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 19:07:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-11-20 19:07:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 19:07:20,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:07:20,999 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 10, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:21,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 19:07:21,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 19:07:21,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-20 19:07:21,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:07:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1190971482, now seen corresponding path program 1 times [2024-11-20 19:07:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:07:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178122534] [2024-11-20 19:07:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:07:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 19:07:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:07:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:07:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 19:07:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:07:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:07:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:07:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-11-20 19:07:21,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:07:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178122534] [2024-11-20 19:07:21,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178122534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:07:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050164190] [2024-11-20 19:07:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:07:21,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:21,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:07:21,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:07:21,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 19:07:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:07:21,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:07:21,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:07:22,002 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-20 19:07:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-20 19:07:22,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:07:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050164190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:07:22,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:07:22,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-20 19:07:22,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748069483] [2024-11-20 19:07:22,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:07:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:07:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:07:22,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:07:22,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-20 19:07:22,020 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 19:07:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:07:22,079 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-20 19:07:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 19:07:22,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 120 [2024-11-20 19:07:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:07:22,080 INFO L225 Difference]: With dead ends: 49 [2024-11-20 19:07:22,080 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 19:07:22,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-20 19:07:22,081 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:07:22,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:07:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 19:07:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 19:07:22,082 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-20 19:07:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 19:07:22,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-11-20 19:07:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:07:22,082 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 19:07:22,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 19:07:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 19:07:22,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 19:07:22,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-20 19:07:22,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-20 19:07:22,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-20 19:07:22,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-20 19:07:22,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-20 19:07:22,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-20 19:07:22,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-20 19:07:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:07:22,289 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:07:22,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 19:08:02,524 WARN L286 SmtUtils]: Spent 40.17s on a formula simplification. DAG size of input: 73 DAG size of output: 56 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-20 19:08:03,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:08:03,356 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_23_to_23_0 contained old-variable. Original clause: (and (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#2| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2) 2147483648))) (exists ((v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#3| v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_2) 2147483648))) (= |#memory_int#1| |old(#memory_int#1)|) (<= 0 (+ (select (select |old(#memory_int#1)| |func_to_recursive_line_23_to_23_0_#in~c.base|) |func_to_recursive_line_23_to_23_0_#in~c.offset|) 2147483648)) (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#2| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_3) 5)) (exists ((v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#3| v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_3) 5))) Eliminated clause: (and (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#2| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2) 2147483648))) (exists ((v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#3| v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_2) 2147483648))) (<= 0 (+ (select (select |#memory_int#1| |func_to_recursive_line_23_to_23_0_#in~c.base|) |func_to_recursive_line_23_to_23_0_#in~c.offset|) 2147483648)) (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#2| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_3) 5)) (exists ((v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#3| v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_3) 5))) [2024-11-20 19:08:03,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,366 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,368 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 19:08:03,369 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-20 19:08:03,369 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-11-20 19:08:03,369 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 19:08:03,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-20 19:08:03,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~c!base,]]] [2024-11-20 19:08:03,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,375 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_22_to_23_0 contained old-variable. Original clause: (and (exists ((v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#3| v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_2) 2147483648))) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|) (<= 0 (+ 2147483648 (select (select |old(#memory_int#2)| |func_to_recursive_line_22_to_23_0_#in~b.base|) |func_to_recursive_line_22_to_23_0_#in~b.offset|))) (exists ((v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#3| v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_3) 5))) Eliminated clause: (and (<= 0 (+ (select (select |#memory_int#2| |func_to_recursive_line_22_to_23_0_#in~b.base|) |func_to_recursive_line_22_to_23_0_#in~b.offset|) 2147483648)) (exists ((v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#3| v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_2) 2147483648))) (exists ((v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#3| v_func_to_recursive_line_21_to_22_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_21_to_22_0_~a.offset_BEFORE_CALL_3) 5))) [2024-11-20 19:08:03,377 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-20 19:08:03,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-20 19:08:03,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-20 19:08:03,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-20 19:08:03,379 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-20 19:08:03,379 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-20 19:08:03,379 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,381 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_22_0 contained old-variable. Original clause: (let ((.cse0 (select (select |old(#memory_int#3)| |func_to_recursive_line_21_to_22_0_#in~a.base|) |func_to_recursive_line_21_to_22_0_#in~a.offset|)) (.cse1 (select (select |#memory_int#3| |func_to_recursive_line_21_to_22_0_#in~a.base|) |func_to_recursive_line_21_to_22_0_#in~a.offset|))) (and (<= 0 (+ .cse0 2147483648)) (or (not (= .cse0 0)) (= .cse1 0)) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|) (<= 0 (+ .cse1 2147483648)) (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |old(#memory_int#2)| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2) 2147483648))))) Eliminated clause: (let ((.cse1 (select (select |#memory_int#3| |func_to_recursive_line_21_to_22_0_#in~a.base|) |func_to_recursive_line_21_to_22_0_#in~a.offset|))) (and (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#2| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2) 2147483648))) (exists ((|old(#memory_int#3)| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |old(#memory_int#3)| |func_to_recursive_line_21_to_22_0_#in~a.base|) |func_to_recursive_line_21_to_22_0_#in~a.offset|))) (and (<= 0 (+ .cse0 2147483648)) (or (not (= .cse0 0)) (= .cse1 0))))) (<= 0 (+ .cse1 2147483648)))) [2024-11-20 19:08:03,383 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,383 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-20 19:08:03,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-20 19:08:03,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-20 19:08:03,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-20 19:08:03,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-11-20 19:08:03,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-11-20 19:08:03,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 19:08:03,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:08:03 BoogieIcfgContainer [2024-11-20 19:08:03,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:08:03,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:08:03,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:08:03,387 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:08:03,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:07:07" (3/4) ... [2024-11-20 19:08:03,390 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 19:08:03,394 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_23_to_23_0 [2024-11-20 19:08:03,394 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_22_to_23_0 [2024-11-20 19:08:03,394 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_22_0 [2024-11-20 19:08:03,400 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-20 19:08:03,400 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-20 19:08:03,400 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 19:08:03,401 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 19:08:03,505 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 19:08:03,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 19:08:03,506 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:08:03,506 INFO L158 Benchmark]: Toolchain (without parser) took 56869.21ms. Allocated memory was 163.6MB in the beginning and 427.8MB in the end (delta: 264.2MB). Free memory was 109.5MB in the beginning and 148.0MB in the end (delta: -38.5MB). Peak memory consumption was 228.4MB. Max. memory is 16.1GB. [2024-11-20 19:08:03,507 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 163.6MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:08:03,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.15ms. Allocated memory is still 163.6MB. Free memory was 109.1MB in the beginning and 96.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 19:08:03,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.08ms. Allocated memory is still 163.6MB. Free memory was 96.9MB in the beginning and 95.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:08:03,507 INFO L158 Benchmark]: Boogie Preprocessor took 55.92ms. Allocated memory is still 163.6MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:08:03,507 INFO L158 Benchmark]: RCFGBuilder took 420.69ms. Allocated memory is still 163.6MB. Free memory was 93.1MB in the beginning and 78.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 19:08:03,508 INFO L158 Benchmark]: TraceAbstraction took 55972.48ms. Allocated memory was 163.6MB in the beginning and 427.8MB in the end (delta: 264.2MB). Free memory was 77.6MB in the beginning and 153.2MB in the end (delta: -75.7MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. [2024-11-20 19:08:03,508 INFO L158 Benchmark]: Witness Printer took 119.30ms. Allocated memory is still 427.8MB. Free memory was 153.2MB in the beginning and 148.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 19:08:03,511 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 163.6MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.15ms. Allocated memory is still 163.6MB. Free memory was 109.1MB in the beginning and 96.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.08ms. Allocated memory is still 163.6MB. Free memory was 96.9MB in the beginning and 95.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.92ms. Allocated memory is still 163.6MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.69ms. Allocated memory is still 163.6MB. Free memory was 93.1MB in the beginning and 78.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 55972.48ms. Allocated memory was 163.6MB in the beginning and 427.8MB in the end (delta: 264.2MB). Free memory was 77.6MB in the beginning and 153.2MB in the end (delta: -75.7MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. * Witness Printer took 119.30ms. Allocated memory is still 427.8MB. Free memory was 153.2MB in the beginning and 148.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 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 IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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 IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~a!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: 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 - 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: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: 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 4 procedures, 44 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 1629 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1294 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 978 IncrementalHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 335 mSDtfsCounter, 978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 720 SyntacticMatches, 8 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=7, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 1122 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1233 ConstructedInterpolants, 154 QuantifiedInterpolants, 5311 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2413 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 2567/3068 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-20 19:08:03,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE