./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.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 ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:11:17,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:11:17,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 11:11:17,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:11:17,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:11:17,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:11:17,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:11:17,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:11:18,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:11:18,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:11:18,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:11:18,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:11:18,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:11:18,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:11:18,003 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:11:18,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:11:18,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:11:18,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 11:11:18,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 11:11:18,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 11:11:18,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:11:18,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:11:18,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:11:18,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:11:18,009 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:11:18,010 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:11:18,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:11:18,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 11:11:18,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:11:18,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:11:18,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:11:18,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:11:18,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:11:18,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:11:18,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:11:18,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:11:18,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:11:18,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:11:18,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 11:11:18,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 11:11:18,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:11:18,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:11:18,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:11:18,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:11:18,016 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 -> ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e [2024-11-19 11:11:18,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:11:18,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:11:18,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:11:18,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:11:18,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:11:18,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2024-11-19 11:11:19,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:11:19,862 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:11:19,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2024-11-19 11:11:19,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6fd414f/31d4453b9c15467da4cdf968fb127046/FLAG8537095f2 [2024-11-19 11:11:19,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6fd414f/31d4453b9c15467da4cdf968fb127046 [2024-11-19 11:11:19,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:11:19,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:11:19,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:11:19,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:11:19,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:11:19,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:11:19" (1/1) ... [2024-11-19 11:11:19,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bbb6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:19, skipping insertion in model container [2024-11-19 11:11:19,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:11:19" (1/1) ... [2024-11-19 11:11:19,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:11:20,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:11:20,171 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:11:20,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:11:20,228 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:11:20,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20 WrapperNode [2024-11-19 11:11:20,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:11:20,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:11:20,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:11:20,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:11:20,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,311 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2024-11-19 11:11:20,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:11:20,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:11:20,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:11:20,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:11:20,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,391 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 5, 15, 21, 11, 12]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 1, 2, 2, 2, 2]. [2024-11-19 11:11:20,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:11:20,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:11:20,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:11:20,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:11:20,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (1/1) ... [2024-11-19 11:11:20,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:11:20,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:20,455 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-19 11:11:20,459 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-19 11:11:20,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:11:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 11:11:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 11:11:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 11:11:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 11:11:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 11:11:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 11:11:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 11:11:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 11:11:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 11:11:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 11:11:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 11:11:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 11:11:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 11:11:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_39_0 [2024-11-19 11:11:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_39_0 [2024-11-19 11:11:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:11:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:11:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 11:11:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 11:11:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 11:11:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 11:11:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 11:11:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 11:11:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 11:11:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 11:11:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 11:11:20,628 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:11:20,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:11:21,596 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2024-11-19 11:11:21,597 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:11:21,619 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:11:21,620 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 11:11:21,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:11:21 BoogieIcfgContainer [2024-11-19 11:11:21,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:11:21,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:11:21,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:11:21,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:11:21,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:11:19" (1/3) ... [2024-11-19 11:11:21,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f0a50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:11:21, skipping insertion in model container [2024-11-19 11:11:21,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:11:20" (2/3) ... [2024-11-19 11:11:21,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f0a50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:11:21, skipping insertion in model container [2024-11-19 11:11:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:11:21" (3/3) ... [2024-11-19 11:11:21,632 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_cohencu.c [2024-11-19 11:11:21,649 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:11:21,649 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2024-11-19 11:11:21,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:11:21,727 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;@163255c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:11:21,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2024-11-19 11:11:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 11:11:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 11:11:21,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:21,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 11:11:21,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:21,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash 476001869, now seen corresponding path program 1 times [2024-11-19 11:11:21,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:21,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650081784] [2024-11-19 11:11:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:22,272 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-19 11:11:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650081784] [2024-11-19 11:11:22,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650081784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:22,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:22,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128163784] [2024-11-19 11:11:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:22,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:22,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:22,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:22,308 INFO L87 Difference]: Start difference. First operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 11:11:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:22,657 INFO L93 Difference]: Finished difference Result 738 states and 792 transitions. [2024-11-19 11:11:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:22,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 11:11:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:22,677 INFO L225 Difference]: With dead ends: 738 [2024-11-19 11:11:22,678 INFO L226 Difference]: Without dead ends: 418 [2024-11-19 11:11:22,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:22,689 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 205 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:22,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1530 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-19 11:11:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 371. [2024-11-19 11:11:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8497652582159625) internal successors, (394), 351 states have internal predecessors, (394), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-19 11:11:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2024-11-19 11:11:22,772 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 6 [2024-11-19 11:11:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:22,774 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2024-11-19 11:11:22,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 11:11:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2024-11-19 11:11:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 11:11:22,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:22,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:11:22,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 11:11:22,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:22,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:22,779 INFO L85 PathProgramCache]: Analyzing trace with hash 13280284, now seen corresponding path program 1 times [2024-11-19 11:11:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37120532] [2024-11-19 11:11:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:23,009 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-19 11:11:23,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:23,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37120532] [2024-11-19 11:11:23,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37120532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:23,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289217713] [2024-11-19 11:11:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:23,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:23,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:23,016 INFO L87 Difference]: Start difference. First operand 371 states and 429 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-19 11:11:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:23,190 INFO L93 Difference]: Finished difference Result 418 states and 434 transitions. [2024-11-19 11:11:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:23,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2024-11-19 11:11:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:23,192 INFO L225 Difference]: With dead ends: 418 [2024-11-19 11:11:23,192 INFO L226 Difference]: Without dead ends: 414 [2024-11-19 11:11:23,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:23,194 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 200 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:23,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1479 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:11:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-19 11:11:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 371. [2024-11-19 11:11:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8309859154929577) internal successors, (390), 351 states have internal predecessors, (390), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-19 11:11:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2024-11-19 11:11:23,218 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 16 [2024-11-19 11:11:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:23,218 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2024-11-19 11:11:23,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-19 11:11:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2024-11-19 11:11:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 11:11:23,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:23,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:11:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 11:11:23,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:23,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1803988512, now seen corresponding path program 1 times [2024-11-19 11:11:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:23,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465917078] [2024-11-19 11:11:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:23,402 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-19 11:11:23,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465917078] [2024-11-19 11:11:23,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465917078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268479487] [2024-11-19 11:11:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:23,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:23,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:23,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:23,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:23,407 INFO L87 Difference]: Start difference. First operand 371 states and 425 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-19 11:11:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:23,572 INFO L93 Difference]: Finished difference Result 414 states and 430 transitions. [2024-11-19 11:11:23,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:23,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 20 [2024-11-19 11:11:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:23,575 INFO L225 Difference]: With dead ends: 414 [2024-11-19 11:11:23,575 INFO L226 Difference]: Without dead ends: 412 [2024-11-19 11:11:23,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:23,576 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 186 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:23,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1481 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:11:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-19 11:11:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 371. [2024-11-19 11:11:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8215962441314555) internal successors, (388), 351 states have internal predecessors, (388), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-19 11:11:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2024-11-19 11:11:23,592 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 20 [2024-11-19 11:11:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:23,593 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2024-11-19 11:11:23,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-19 11:11:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2024-11-19 11:11:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 11:11:23,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:23,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:11:23,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 11:11:23,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:23,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1533829314, now seen corresponding path program 1 times [2024-11-19 11:11:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247568988] [2024-11-19 11:11:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:23,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:23,786 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-19 11:11:23,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:23,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247568988] [2024-11-19 11:11:23,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247568988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:23,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:23,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 11:11:23,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026280125] [2024-11-19 11:11:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:23,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 11:11:23,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:23,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 11:11:23,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:11:23,788 INFO L87 Difference]: Start difference. First operand 371 states and 423 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-19 11:11:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:23,987 INFO L93 Difference]: Finished difference Result 412 states and 428 transitions. [2024-11-19 11:11:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 11:11:23,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 22 [2024-11-19 11:11:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:23,989 INFO L225 Difference]: With dead ends: 412 [2024-11-19 11:11:23,990 INFO L226 Difference]: Without dead ends: 410 [2024-11-19 11:11:23,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:11:23,992 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 188 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:23,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1549 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:11:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-19 11:11:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2024-11-19 11:11:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.812206572769953) internal successors, (386), 351 states have internal predecessors, (386), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-19 11:11:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 421 transitions. [2024-11-19 11:11:24,004 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 421 transitions. Word has length 22 [2024-11-19 11:11:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:24,005 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 421 transitions. [2024-11-19 11:11:24,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-19 11:11:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 421 transitions. [2024-11-19 11:11:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 11:11:24,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:24,006 INFO L215 NwaCegarLoop]: trace histogram [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-19 11:11:24,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 11:11:24,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:24,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash 304068537, now seen corresponding path program 1 times [2024-11-19 11:11:24,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321006050] [2024-11-19 11:11:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:24,175 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-19 11:11:24,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:24,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321006050] [2024-11-19 11:11:24,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321006050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:24,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:24,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:24,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507667949] [2024-11-19 11:11:24,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:24,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:24,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:24,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:24,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:24,180 INFO L87 Difference]: Start difference. First operand 371 states and 421 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-19 11:11:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:24,339 INFO L93 Difference]: Finished difference Result 410 states and 426 transitions. [2024-11-19 11:11:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:24,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 23 [2024-11-19 11:11:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:24,342 INFO L225 Difference]: With dead ends: 410 [2024-11-19 11:11:24,342 INFO L226 Difference]: Without dead ends: 408 [2024-11-19 11:11:24,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:24,343 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 175 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:24,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1483 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:11:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-19 11:11:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 371. [2024-11-19 11:11:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8028169014084507) internal successors, (384), 351 states have internal predecessors, (384), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-19 11:11:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 419 transitions. [2024-11-19 11:11:24,358 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 419 transitions. Word has length 23 [2024-11-19 11:11:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:24,358 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 419 transitions. [2024-11-19 11:11:24,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-19 11:11:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 419 transitions. [2024-11-19 11:11:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 11:11:24,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:24,360 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-19 11:11:24,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 11:11:24,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:24,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash 952671999, now seen corresponding path program 1 times [2024-11-19 11:11:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:24,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969753761] [2024-11-19 11:11:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:24,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44277242] [2024-11-19 11:11:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:24,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:24,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:24,388 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-19 11:11:24,389 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-19 11:11:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:24,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 11:11:24,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:24,531 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-19 11:11:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:11:24,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:11:25,726 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 24 treesize of output 16 [2024-11-19 11:11:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 11:11:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969753761] [2024-11-19 11:11:25,820 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 11:11:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44277242] [2024-11-19 11:11:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44277242] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:11:25,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 11:11:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-19 11:11:25,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058467220] [2024-11-19 11:11:25,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 11:11:25,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 11:11:25,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 11:11:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-19 11:11:25,822 INFO L87 Difference]: Start difference. First operand 371 states and 419 transitions. Second operand has 17 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 11:11:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:26,808 INFO L93 Difference]: Finished difference Result 602 states and 621 transitions. [2024-11-19 11:11:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 11:11:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-11-19 11:11:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:26,813 INFO L225 Difference]: With dead ends: 602 [2024-11-19 11:11:26,813 INFO L226 Difference]: Without dead ends: 598 [2024-11-19 11:11:26,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2024-11-19 11:11:26,816 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 681 mSDsluCounter, 3927 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:26,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 4201 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 11:11:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-19 11:11:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 453. [2024-11-19 11:11:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8131487889273357) internal successors, (524), 427 states have internal predecessors, (524), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2024-11-19 11:11:26,842 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 32 [2024-11-19 11:11:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:26,843 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2024-11-19 11:11:26,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.857142857142857) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 11:11:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2024-11-19 11:11:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 11:11:26,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:26,845 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:26,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 11:11:27,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 11:11:27,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:27,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1089407434, now seen corresponding path program 1 times [2024-11-19 11:11:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570469314] [2024-11-19 11:11:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:27,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108864149] [2024-11-19 11:11:27,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:27,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:27,077 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-19 11:11:27,079 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-19 11:11:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:27,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 11:11:27,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:27,200 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-19 11:11:27,205 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-19 11:11:27,490 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-19 11:11:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 11:11:27,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:11:27,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570469314] [2024-11-19 11:11:27,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 11:11:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108864149] [2024-11-19 11:11:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108864149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:27,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 11:11:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504674737] [2024-11-19 11:11:27,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:27,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 11:11:27,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:27,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 11:11:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:11:27,510 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:31,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 11:11:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:31,885 INFO L93 Difference]: Finished difference Result 594 states and 613 transitions. [2024-11-19 11:11:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 11:11:31,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-19 11:11:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:31,888 INFO L225 Difference]: With dead ends: 594 [2024-11-19 11:11:31,888 INFO L226 Difference]: Without dead ends: 593 [2024-11-19 11:11:31,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:11:31,889 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 361 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:31,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1506 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 285 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-19 11:11:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-19 11:11:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 453. [2024-11-19 11:11:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8096885813148789) internal successors, (523), 427 states have internal predecessors, (523), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 568 transitions. [2024-11-19 11:11:31,907 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 568 transitions. Word has length 42 [2024-11-19 11:11:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:31,908 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 568 transitions. [2024-11-19 11:11:31,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 568 transitions. [2024-11-19 11:11:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 11:11:31,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:31,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:31,927 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-19 11:11:32,110 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,SelfDestructingSolverStorable6 [2024-11-19 11:11:32,111 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:32,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 588107993, now seen corresponding path program 1 times [2024-11-19 11:11:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817902492] [2024-11-19 11:11:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508819134] [2024-11-19 11:11:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:32,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:32,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:32,146 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-19 11:11:32,150 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-19 11:11:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:32,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 11:11:32,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:32,263 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-19 11:11:32,269 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-19 11:11:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 11:11:32,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:11:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817902492] [2024-11-19 11:11:32,934 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 11:11:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508819134] [2024-11-19 11:11:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508819134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:11:32,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:11:32,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-19 11:11:32,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749283831] [2024-11-19 11:11:32,934 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 11:11:32,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 11:11:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:32,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 11:11:32,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:11:32,935 INFO L87 Difference]: Start difference. First operand 453 states and 568 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 11:11:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:33,462 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2024-11-19 11:11:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 11:11:33,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-19 11:11:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:33,465 INFO L225 Difference]: With dead ends: 593 [2024-11-19 11:11:33,465 INFO L226 Difference]: Without dead ends: 592 [2024-11-19 11:11:33,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-19 11:11:33,467 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 582 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:33,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1777 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 11:11:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-19 11:11:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 453. [2024-11-19 11:11:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.806228373702422) internal successors, (522), 427 states have internal predecessors, (522), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 567 transitions. [2024-11-19 11:11:33,481 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 567 transitions. Word has length 43 [2024-11-19 11:11:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:33,482 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 567 transitions. [2024-11-19 11:11:33,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 11:11:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 567 transitions. [2024-11-19 11:11:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 11:11:33,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:33,485 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:33,503 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-19 11:11:33,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:33,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:33,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1051478680, now seen corresponding path program 1 times [2024-11-19 11:11:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253604604] [2024-11-19 11:11:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 11:11:33,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:33,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253604604] [2024-11-19 11:11:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253604604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:33,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:33,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577819674] [2024-11-19 11:11:33,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:33,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:33,865 INFO L87 Difference]: Start difference. First operand 453 states and 567 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:34,058 INFO L93 Difference]: Finished difference Result 560 states and 580 transitions. [2024-11-19 11:11:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:34,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-19 11:11:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:34,063 INFO L225 Difference]: With dead ends: 560 [2024-11-19 11:11:34,063 INFO L226 Difference]: Without dead ends: 558 [2024-11-19 11:11:34,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:34,064 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 313 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:34,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1431 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-19 11:11:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 453. [2024-11-19 11:11:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7993079584775087) internal successors, (520), 427 states have internal predecessors, (520), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 565 transitions. [2024-11-19 11:11:34,080 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 565 transitions. Word has length 44 [2024-11-19 11:11:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:34,080 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 565 transitions. [2024-11-19 11:11:34,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 565 transitions. [2024-11-19 11:11:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 11:11:34,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:34,083 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:34,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 11:11:34,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:34,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1153699578, now seen corresponding path program 1 times [2024-11-19 11:11:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:34,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312730172] [2024-11-19 11:11:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 11:11:34,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:34,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312730172] [2024-11-19 11:11:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312730172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:34,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:34,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 11:11:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785237500] [2024-11-19 11:11:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:34,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 11:11:34,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:34,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 11:11:34,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:11:34,279 INFO L87 Difference]: Start difference. First operand 453 states and 565 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:34,596 INFO L93 Difference]: Finished difference Result 558 states and 578 transitions. [2024-11-19 11:11:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 11:11:34,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-19 11:11:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:34,599 INFO L225 Difference]: With dead ends: 558 [2024-11-19 11:11:34,599 INFO L226 Difference]: Without dead ends: 557 [2024-11-19 11:11:34,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:11:34,600 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 328 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:34,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1483 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 11:11:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-19 11:11:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 453. [2024-11-19 11:11:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7958477508650519) internal successors, (519), 427 states have internal predecessors, (519), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 564 transitions. [2024-11-19 11:11:34,638 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 564 transitions. Word has length 46 [2024-11-19 11:11:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:34,638 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 564 transitions. [2024-11-19 11:11:34,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 564 transitions. [2024-11-19 11:11:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 11:11:34,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:34,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:34,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 11:11:34,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:34,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1404948637, now seen corresponding path program 1 times [2024-11-19 11:11:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:34,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010165468] [2024-11-19 11:11:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 11:11:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010165468] [2024-11-19 11:11:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010165468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:34,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836627113] [2024-11-19 11:11:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:34,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:34,858 INFO L87 Difference]: Start difference. First operand 453 states and 564 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:35,214 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2024-11-19 11:11:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:35,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-19 11:11:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:35,217 INFO L225 Difference]: With dead ends: 557 [2024-11-19 11:11:35,217 INFO L226 Difference]: Without dead ends: 556 [2024-11-19 11:11:35,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:35,218 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 306 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:35,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 11:11:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-19 11:11:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2024-11-19 11:11:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.792387543252595) internal successors, (518), 427 states have internal predecessors, (518), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 563 transitions. [2024-11-19 11:11:35,231 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 563 transitions. Word has length 47 [2024-11-19 11:11:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:35,231 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 563 transitions. [2024-11-19 11:11:35,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 563 transitions. [2024-11-19 11:11:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 11:11:35,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:35,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:35,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 11:11:35,233 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:35,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash 603734876, now seen corresponding path program 1 times [2024-11-19 11:11:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:35,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775072823] [2024-11-19 11:11:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 11:11:35,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775072823] [2024-11-19 11:11:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775072823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:35,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:35,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18334291] [2024-11-19 11:11:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:35,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:35,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:35,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:35,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:35,380 INFO L87 Difference]: Start difference. First operand 453 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:35,581 INFO L93 Difference]: Finished difference Result 568 states and 588 transitions. [2024-11-19 11:11:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:35,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-19 11:11:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:35,584 INFO L225 Difference]: With dead ends: 568 [2024-11-19 11:11:35,584 INFO L226 Difference]: Without dead ends: 566 [2024-11-19 11:11:35,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:35,585 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 311 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:35,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1423 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-19 11:11:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2024-11-19 11:11:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7854671280276817) internal successors, (516), 427 states have internal predecessors, (516), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 561 transitions. [2024-11-19 11:11:35,597 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 561 transitions. Word has length 48 [2024-11-19 11:11:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:35,598 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 561 transitions. [2024-11-19 11:11:35,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 561 transitions. [2024-11-19 11:11:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 11:11:35,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:35,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:35,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 11:11:35,599 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:35,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash 368633790, now seen corresponding path program 1 times [2024-11-19 11:11:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:35,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830950748] [2024-11-19 11:11:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:35,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381633598] [2024-11-19 11:11:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:35,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:35,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:35,619 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-19 11:11:35,621 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-19 11:11:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:35,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 11:11:35,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:35,733 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-19 11:11:35,737 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-19 11:11:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 11:11:36,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:11:36,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:36,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830950748] [2024-11-19 11:11:36,802 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 11:11:36,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381633598] [2024-11-19 11:11:36,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381633598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:11:36,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:11:36,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-19 11:11:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725927852] [2024-11-19 11:11:36,802 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 11:11:36,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 11:11:36,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:36,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 11:11:36,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-19 11:11:36,804 INFO L87 Difference]: Start difference. First operand 453 states and 561 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 11:11:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:38,023 INFO L93 Difference]: Finished difference Result 586 states and 605 transitions. [2024-11-19 11:11:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 11:11:38,023 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-11-19 11:11:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:38,026 INFO L225 Difference]: With dead ends: 586 [2024-11-19 11:11:38,026 INFO L226 Difference]: Without dead ends: 584 [2024-11-19 11:11:38,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 11:11:38,027 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 813 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:38,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2425 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 11:11:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-19 11:11:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 453. [2024-11-19 11:11:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.778546712802768) internal successors, (514), 427 states have internal predecessors, (514), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 559 transitions. [2024-11-19 11:11:38,040 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 559 transitions. Word has length 50 [2024-11-19 11:11:38,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:38,040 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 559 transitions. [2024-11-19 11:11:38,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 11:11:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 559 transitions. [2024-11-19 11:11:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 11:11:38,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:38,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:38,059 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-19 11:11:38,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:38,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_39_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:38,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2069756960, now seen corresponding path program 1 times [2024-11-19 11:11:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:38,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120785437] [2024-11-19 11:11:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:38,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 11:11:38,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:38,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120785437] [2024-11-19 11:11:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120785437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916042332] [2024-11-19 11:11:38,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:38,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:38,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:38,465 INFO L87 Difference]: Start difference. First operand 453 states and 559 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:38,661 INFO L93 Difference]: Finished difference Result 576 states and 596 transitions. [2024-11-19 11:11:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:38,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-19 11:11:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:38,663 INFO L225 Difference]: With dead ends: 576 [2024-11-19 11:11:38,663 INFO L226 Difference]: Without dead ends: 574 [2024-11-19 11:11:38,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:38,664 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 309 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:38,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-19 11:11:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 453. [2024-11-19 11:11:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7716262975778547) internal successors, (512), 427 states have internal predecessors, (512), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 557 transitions. [2024-11-19 11:11:38,678 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 557 transitions. Word has length 52 [2024-11-19 11:11:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:38,678 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 557 transitions. [2024-11-19 11:11:38,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 557 transitions. [2024-11-19 11:11:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 11:11:38,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:38,679 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:38,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 11:11:38,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:38,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash 466583682, now seen corresponding path program 1 times [2024-11-19 11:11:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:38,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017296499] [2024-11-19 11:11:38,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:38,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 11:11:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017296499] [2024-11-19 11:11:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017296499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:38,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:38,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 11:11:38,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948922462] [2024-11-19 11:11:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:38,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 11:11:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:38,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 11:11:38,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:11:38,845 INFO L87 Difference]: Start difference. First operand 453 states and 557 transitions. Second operand has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:39,098 INFO L93 Difference]: Finished difference Result 574 states and 594 transitions. [2024-11-19 11:11:39,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 11:11:39,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-19 11:11:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:39,100 INFO L225 Difference]: With dead ends: 574 [2024-11-19 11:11:39,100 INFO L226 Difference]: Without dead ends: 572 [2024-11-19 11:11:39,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:11:39,101 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 310 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:39,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1461 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-19 11:11:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2024-11-19 11:11:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7647058823529411) internal successors, (510), 427 states have internal predecessors, (510), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 555 transitions. [2024-11-19 11:11:39,121 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 555 transitions. Word has length 54 [2024-11-19 11:11:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:39,121 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 555 transitions. [2024-11-19 11:11:39,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 555 transitions. [2024-11-19 11:11:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 11:11:39,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:39,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:39,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 11:11:39,122 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:39,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1579192357, now seen corresponding path program 1 times [2024-11-19 11:11:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858064837] [2024-11-19 11:11:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 11:11:39,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858064837] [2024-11-19 11:11:39,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858064837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:39,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:39,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 11:11:39,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698842646] [2024-11-19 11:11:39,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:39,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 11:11:39,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:39,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 11:11:39,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:39,708 INFO L87 Difference]: Start difference. First operand 453 states and 555 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:40,458 INFO L93 Difference]: Finished difference Result 548 states and 568 transitions. [2024-11-19 11:11:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 11:11:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-19 11:11:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:40,461 INFO L225 Difference]: With dead ends: 548 [2024-11-19 11:11:40,461 INFO L226 Difference]: Without dead ends: 546 [2024-11-19 11:11:40,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:11:40,462 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 292 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:40,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1797 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 11:11:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-19 11:11:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 453. [2024-11-19 11:11:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7577854671280277) internal successors, (508), 427 states have internal predecessors, (508), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 553 transitions. [2024-11-19 11:11:40,484 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 553 transitions. Word has length 55 [2024-11-19 11:11:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:40,485 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 553 transitions. [2024-11-19 11:11:40,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 11:11:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 553 transitions. [2024-11-19 11:11:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 11:11:40,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:40,486 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:40,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 11:11:40,486 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:40,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1656337381, now seen corresponding path program 1 times [2024-11-19 11:11:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:40,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142474933] [2024-11-19 11:11:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:40,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630278299] [2024-11-19 11:11:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:40,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:40,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:40,518 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-19 11:11:40,520 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-19 11:11:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:40,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 11:11:40,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:40,638 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-19 11:11:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 11:11:40,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:11:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142474933] [2024-11-19 11:11:40,796 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 11:11:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630278299] [2024-11-19 11:11:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630278299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:40,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 11:11:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093833835] [2024-11-19 11:11:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:40,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 11:11:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 11:11:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:11:40,797 INFO L87 Difference]: Start difference. First operand 453 states and 553 transitions. Second operand has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:41,023 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2024-11-19 11:11:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 11:11:41,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-19 11:11:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:41,025 INFO L225 Difference]: With dead ends: 582 [2024-11-19 11:11:41,025 INFO L226 Difference]: Without dead ends: 581 [2024-11-19 11:11:41,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:11:41,026 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 314 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:41,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1568 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-19 11:11:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 453. [2024-11-19 11:11:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.754325259515571) internal successors, (507), 427 states have internal predecessors, (507), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 552 transitions. [2024-11-19 11:11:41,040 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 552 transitions. Word has length 64 [2024-11-19 11:11:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:41,041 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 552 transitions. [2024-11-19 11:11:41,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 552 transitions. [2024-11-19 11:11:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 11:11:41,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:41,042 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:41,060 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-19 11:11:41,242 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,SelfDestructingSolverStorable16 [2024-11-19 11:11:41,243 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:41,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 193148854, now seen corresponding path program 1 times [2024-11-19 11:11:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:41,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417753105] [2024-11-19 11:11:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:41,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177494534] [2024-11-19 11:11:41,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:41,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:41,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:41,263 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-19 11:11:41,266 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-19 11:11:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:41,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 11:11:41,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:41,380 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-19 11:11:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 11:11:41,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:11:41,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:41,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417753105] [2024-11-19 11:11:41,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 11:11:41,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177494534] [2024-11-19 11:11:41,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177494534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:41,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:41,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 11:11:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714358895] [2024-11-19 11:11:41,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:41,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 11:11:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:41,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 11:11:41,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:11:41,578 INFO L87 Difference]: Start difference. First operand 453 states and 552 transitions. Second operand has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:41,802 INFO L93 Difference]: Finished difference Result 581 states and 600 transitions. [2024-11-19 11:11:41,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 11:11:41,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2024-11-19 11:11:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:41,804 INFO L225 Difference]: With dead ends: 581 [2024-11-19 11:11:41,805 INFO L226 Difference]: Without dead ends: 580 [2024-11-19 11:11:41,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:11:41,806 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 311 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:41,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1571 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-19 11:11:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 453. [2024-11-19 11:11:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7508650519031141) internal successors, (506), 427 states have internal predecessors, (506), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 551 transitions. [2024-11-19 11:11:41,822 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 551 transitions. Word has length 65 [2024-11-19 11:11:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:41,822 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 551 transitions. [2024-11-19 11:11:41,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 551 transitions. [2024-11-19 11:11:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 11:11:41,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:41,826 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:41,844 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-19 11:11:42,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 11:11:42,031 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_27_to_39_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:42,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:42,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1692647293, now seen corresponding path program 1 times [2024-11-19 11:11:42,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:42,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754721634] [2024-11-19 11:11:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:42,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 11:11:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:42,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754721634] [2024-11-19 11:11:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754721634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:42,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:42,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:42,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478929291] [2024-11-19 11:11:42,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:42,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:42,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:42,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:42,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:42,198 INFO L87 Difference]: Start difference. First operand 453 states and 551 transitions. Second operand has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:42,412 INFO L93 Difference]: Finished difference Result 556 states and 576 transitions. [2024-11-19 11:11:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:42,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-11-19 11:11:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:42,415 INFO L225 Difference]: With dead ends: 556 [2024-11-19 11:11:42,415 INFO L226 Difference]: Without dead ends: 554 [2024-11-19 11:11:42,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:42,416 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 274 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:42,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1423 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-19 11:11:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 453. [2024-11-19 11:11:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7439446366782008) internal successors, (504), 427 states have internal predecessors, (504), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 549 transitions. [2024-11-19 11:11:42,429 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 549 transitions. Word has length 66 [2024-11-19 11:11:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:42,430 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 549 transitions. [2024-11-19 11:11:42,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 549 transitions. [2024-11-19 11:11:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 11:11:42,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:42,431 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:42,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 11:11:42,431 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_27_to_39_0Err38ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:42,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1158552865, now seen corresponding path program 1 times [2024-11-19 11:11:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:42,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887283011] [2024-11-19 11:11:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20440760] [2024-11-19 11:11:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:42,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:42,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:11:42,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 11:11:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:42,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 11:11:42,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:42,600 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-19 11:11:42,605 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-19 11:11:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 11:11:43,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:11:43,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:43,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887283011] [2024-11-19 11:11:43,008 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 11:11:43,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20440760] [2024-11-19 11:11:43,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20440760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:43,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:43,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 11:11:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705871886] [2024-11-19 11:11:43,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:43,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 11:11:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 11:11:43,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:43,010 INFO L87 Difference]: Start difference. First operand 453 states and 549 transitions. Second operand has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:43,338 INFO L93 Difference]: Finished difference Result 574 states and 593 transitions. [2024-11-19 11:11:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 11:11:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2024-11-19 11:11:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:43,340 INFO L225 Difference]: With dead ends: 574 [2024-11-19 11:11:43,340 INFO L226 Difference]: Without dead ends: 572 [2024-11-19 11:11:43,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-19 11:11:43,341 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 496 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:43,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1468 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 11:11:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-19 11:11:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2024-11-19 11:11:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7370242214532872) internal successors, (502), 427 states have internal predecessors, (502), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 547 transitions. [2024-11-19 11:11:43,357 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 547 transitions. Word has length 68 [2024-11-19 11:11:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 547 transitions. [2024-11-19 11:11:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 547 transitions. [2024-11-19 11:11:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 11:11:43,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:43,358 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:43,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 11:11:43,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:43,558 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_27_to_39_0Err40ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:43,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash -972769727, now seen corresponding path program 1 times [2024-11-19 11:11:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:43,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412145151] [2024-11-19 11:11:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 11:11:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:43,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412145151] [2024-11-19 11:11:43,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412145151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:43,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:43,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:43,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508584707] [2024-11-19 11:11:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:43,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:43,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:43,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:43,713 INFO L87 Difference]: Start difference. First operand 453 states and 547 transitions. Second operand has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:43,932 INFO L93 Difference]: Finished difference Result 564 states and 584 transitions. [2024-11-19 11:11:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:43,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2024-11-19 11:11:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:43,935 INFO L225 Difference]: With dead ends: 564 [2024-11-19 11:11:43,935 INFO L226 Difference]: Without dead ends: 562 [2024-11-19 11:11:43,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:43,936 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 272 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:43,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1415 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-19 11:11:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 453. [2024-11-19 11:11:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7301038062283738) internal successors, (500), 427 states have internal predecessors, (500), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 545 transitions. [2024-11-19 11:11:43,950 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 545 transitions. Word has length 70 [2024-11-19 11:11:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:43,951 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 545 transitions. [2024-11-19 11:11:43,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 545 transitions. [2024-11-19 11:11:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 11:11:43,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:43,952 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:43,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 11:11:43,952 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:43,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1471166883, now seen corresponding path program 1 times [2024-11-19 11:11:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:43,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809957358] [2024-11-19 11:11:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524195637] [2024-11-19 11:11:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:43,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:43,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:43,980 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:11:43,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 11:11:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:44,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 11:11:44,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:44,090 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-19 11:11:44,094 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-19 11:11:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 11:11:44,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:11:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809957358] [2024-11-19 11:11:44,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 11:11:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524195637] [2024-11-19 11:11:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524195637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:44,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:44,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 11:11:44,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366771283] [2024-11-19 11:11:44,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:44,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 11:11:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 11:11:44,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:11:44,492 INFO L87 Difference]: Start difference. First operand 453 states and 545 transitions. Second operand has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:44,879 INFO L93 Difference]: Finished difference Result 570 states and 589 transitions. [2024-11-19 11:11:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 11:11:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 72 [2024-11-19 11:11:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:44,884 INFO L225 Difference]: With dead ends: 570 [2024-11-19 11:11:44,884 INFO L226 Difference]: Without dead ends: 566 [2024-11-19 11:11:44,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-19 11:11:44,885 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 446 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:44,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1615 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 11:11:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-19 11:11:44,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2024-11-19 11:11:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7162629757785468) internal successors, (496), 427 states have internal predecessors, (496), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 541 transitions. [2024-11-19 11:11:44,898 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 541 transitions. Word has length 72 [2024-11-19 11:11:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:44,898 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 541 transitions. [2024-11-19 11:11:44,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 11:11:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 541 transitions. [2024-11-19 11:11:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 11:11:44,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:44,899 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:44,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 11:11:45,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 11:11:45,100 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_27_to_39_0Err46ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:45,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash -814628251, now seen corresponding path program 1 times [2024-11-19 11:11:45,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:45,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651881019] [2024-11-19 11:11:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:45,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:45,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651881019] [2024-11-19 11:11:45,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651881019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:45,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:45,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307392988] [2024-11-19 11:11:45,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:45,267 INFO L87 Difference]: Start difference. First operand 453 states and 541 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:11:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:45,371 INFO L93 Difference]: Finished difference Result 457 states and 545 transitions. [2024-11-19 11:11:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:45,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 83 [2024-11-19 11:11:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:45,375 INFO L225 Difference]: With dead ends: 457 [2024-11-19 11:11:45,375 INFO L226 Difference]: Without dead ends: 455 [2024-11-19 11:11:45,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:45,376 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 62 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:45,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1508 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:11:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-19 11:11:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-19 11:11:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 291 states have (on average 1.711340206185567) internal successors, (498), 429 states have internal predecessors, (498), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 543 transitions. [2024-11-19 11:11:45,389 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 543 transitions. Word has length 83 [2024-11-19 11:11:45,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:45,389 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 543 transitions. [2024-11-19 11:11:45,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:11:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 543 transitions. [2024-11-19 11:11:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 11:11:45,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:45,391 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:45,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 11:11:45,391 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_27_to_39_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:45,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1173696761, now seen corresponding path program 1 times [2024-11-19 11:11:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:45,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563846635] [2024-11-19 11:11:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:45,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563846635] [2024-11-19 11:11:45,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563846635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:45,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:45,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394922523] [2024-11-19 11:11:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:45,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:45,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:45,736 INFO L87 Difference]: Start difference. First operand 455 states and 543 transitions. Second operand has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:11:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:45,933 INFO L93 Difference]: Finished difference Result 532 states and 552 transitions. [2024-11-19 11:11:45,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:45,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2024-11-19 11:11:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:45,936 INFO L225 Difference]: With dead ends: 532 [2024-11-19 11:11:45,936 INFO L226 Difference]: Without dead ends: 530 [2024-11-19 11:11:45,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:45,937 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 209 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:45,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1427 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-19 11:11:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 457. [2024-11-19 11:11:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 293 states have (on average 1.7064846416382253) internal successors, (500), 431 states have internal predecessors, (500), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-19 11:11:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 545 transitions. [2024-11-19 11:11:45,951 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 545 transitions. Word has length 85 [2024-11-19 11:11:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:45,951 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 545 transitions. [2024-11-19 11:11:45,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:11:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 545 transitions. [2024-11-19 11:11:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 11:11:45,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:45,955 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:45,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 11:11:45,955 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:45,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2024995937, now seen corresponding path program 1 times [2024-11-19 11:11:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:45,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434718150] [2024-11-19 11:11:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434718150] [2024-11-19 11:11:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434718150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:11:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729902607] [2024-11-19 11:11:46,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:46,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:11:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:46,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:11:46,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:11:46,110 INFO L87 Difference]: Start difference. First operand 457 states and 545 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 11:11:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:46,238 INFO L93 Difference]: Finished difference Result 463 states and 547 transitions. [2024-11-19 11:11:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:11:46,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2024-11-19 11:11:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:46,240 INFO L225 Difference]: With dead ends: 463 [2024-11-19 11:11:46,240 INFO L226 Difference]: Without dead ends: 459 [2024-11-19 11:11:46,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:11:46,241 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 57 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:46,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1049 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:11:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-19 11:11:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-11-19 11:11:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 294 states have (on average 1.6904761904761905) internal successors, (497), 432 states have internal predecessors, (497), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-19 11:11:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 543 transitions. [2024-11-19 11:11:46,257 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 543 transitions. Word has length 86 [2024-11-19 11:11:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:46,257 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 543 transitions. [2024-11-19 11:11:46,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 11:11:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 543 transitions. [2024-11-19 11:11:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 11:11:46,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:46,258 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:46,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 11:11:46,258 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_27_to_39_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:46,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1653816233, now seen corresponding path program 1 times [2024-11-19 11:11:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424635715] [2024-11-19 11:11:46,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424635715] [2024-11-19 11:11:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424635715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172264435] [2024-11-19 11:11:46,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:46,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:46,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:46,577 INFO L87 Difference]: Start difference. First operand 459 states and 543 transitions. Second operand has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:11:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:46,807 INFO L93 Difference]: Finished difference Result 540 states and 560 transitions. [2024-11-19 11:11:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:46,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2024-11-19 11:11:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:46,810 INFO L225 Difference]: With dead ends: 540 [2024-11-19 11:11:46,810 INFO L226 Difference]: Without dead ends: 538 [2024-11-19 11:11:46,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:46,811 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 215 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:46,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1397 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:11:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-19 11:11:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 461. [2024-11-19 11:11:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 296 states have (on average 1.6858108108108107) internal successors, (499), 434 states have internal predecessors, (499), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-19 11:11:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 545 transitions. [2024-11-19 11:11:46,824 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 545 transitions. Word has length 87 [2024-11-19 11:11:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:46,825 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 545 transitions. [2024-11-19 11:11:46,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:11:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 545 transitions. [2024-11-19 11:11:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 11:11:46,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:46,826 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:46,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 11:11:46,826 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_27_to_39_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:46,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash 179505227, now seen corresponding path program 1 times [2024-11-19 11:11:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:46,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861819405] [2024-11-19 11:11:46,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:46,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861819405] [2024-11-19 11:11:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861819405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:11:47,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:11:47,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:11:47,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474838394] [2024-11-19 11:11:47,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:11:47,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:11:47,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:47,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:11:47,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:11:47,078 INFO L87 Difference]: Start difference. First operand 461 states and 545 transitions. Second operand has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:11:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:47,244 INFO L93 Difference]: Finished difference Result 550 states and 570 transitions. [2024-11-19 11:11:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:11:47,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 89 [2024-11-19 11:11:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:47,247 INFO L225 Difference]: With dead ends: 550 [2024-11-19 11:11:47,247 INFO L226 Difference]: Without dead ends: 548 [2024-11-19 11:11:47,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:11:47,248 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 225 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:47,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1443 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:11:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-19 11:11:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 463. [2024-11-19 11:11:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 436 states have internal predecessors, (501), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-19 11:11:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 547 transitions. [2024-11-19 11:11:47,267 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 547 transitions. Word has length 89 [2024-11-19 11:11:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:47,267 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 547 transitions. [2024-11-19 11:11:47,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:11:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 547 transitions. [2024-11-19 11:11:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 11:11:47,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:47,268 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:47,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 11:11:47,269 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:47,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash -585186275, now seen corresponding path program 1 times [2024-11-19 11:11:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743108499] [2024-11-19 11:11:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743108499] [2024-11-19 11:11:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743108499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:11:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173430253] [2024-11-19 11:11:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:47,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:47,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:47,687 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:11:47,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 11:11:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:47,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 11:11:47,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:48,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 15 [2024-11-19 11:11:48,200 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-19 11:11:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:48,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:11:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173430253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:11:48,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:11:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2024-11-19 11:11:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17340528] [2024-11-19 11:11:48,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:11:48,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 11:11:48,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:48,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 11:11:48,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-19 11:11:48,426 INFO L87 Difference]: Start difference. First operand 463 states and 547 transitions. Second operand has 21 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 7 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 11:11:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:48,896 INFO L93 Difference]: Finished difference Result 466 states and 554 transitions. [2024-11-19 11:11:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 11:11:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 7 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 94 [2024-11-19 11:11:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:48,899 INFO L225 Difference]: With dead ends: 466 [2024-11-19 11:11:48,899 INFO L226 Difference]: Without dead ends: 463 [2024-11-19 11:11:48,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 167 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-11-19 11:11:48,900 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 610 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:48,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 3201 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 11:11:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-19 11:11:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2024-11-19 11:11:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 298 states have (on average 1.6711409395973154) internal successors, (498), 433 states have internal predecessors, (498), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-19 11:11:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 544 transitions. [2024-11-19 11:11:48,914 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 544 transitions. Word has length 94 [2024-11-19 11:11:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:48,915 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 544 transitions. [2024-11-19 11:11:48,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 7 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 11:11:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 544 transitions. [2024-11-19 11:11:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 11:11:48,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:48,916 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:48,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 11:11:49,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-19 11:11:49,121 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:49,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash -960905304, now seen corresponding path program 1 times [2024-11-19 11:11:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:49,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185823289] [2024-11-19 11:11:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:49,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:11:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185823289] [2024-11-19 11:11:49,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185823289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:11:49,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670022988] [2024-11-19 11:11:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:49,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:49,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:49,459 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:11:49,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 11:11:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:11:49,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 11:11:49,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:11:49,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-11-19 11:11:49,927 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-19 11:11:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:49,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:11:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:11:50,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670022988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:11:50,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:11:50,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-11-19 11:11:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589056411] [2024-11-19 11:11:50,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:11:50,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 11:11:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:11:50,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 11:11:50,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-19 11:11:50,138 INFO L87 Difference]: Start difference. First operand 460 states and 544 transitions. Second operand has 18 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 11:11:54,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 11:11:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:11:54,708 INFO L93 Difference]: Finished difference Result 591 states and 689 transitions. [2024-11-19 11:11:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 11:11:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 95 [2024-11-19 11:11:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:11:54,711 INFO L225 Difference]: With dead ends: 591 [2024-11-19 11:11:54,711 INFO L226 Difference]: Without dead ends: 588 [2024-11-19 11:11:54,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 172 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 11:11:54,712 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 947 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-19 11:11:54,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 2931 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 372 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-19 11:11:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-19 11:11:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 524. [2024-11-19 11:11:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 355 states have (on average 1.6788732394366197) internal successors, (596), 489 states have internal predecessors, (596), 28 states have call successors, (28), 5 states have call predecessors, (28), 8 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2024-11-19 11:11:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 658 transitions. [2024-11-19 11:11:54,739 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 658 transitions. Word has length 95 [2024-11-19 11:11:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:11:54,740 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 658 transitions. [2024-11-19 11:11:54,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.3125) internal successors, (149), 15 states have internal predecessors, (149), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 11:11:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 658 transitions. [2024-11-19 11:11:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 11:11:54,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:11:54,741 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:11:54,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 11:11:54,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 11:11:54,946 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-19 11:11:54,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:11:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 431466758, now seen corresponding path program 1 times [2024-11-19 11:11:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:11:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57090246] [2024-11-19 11:11:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:11:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 11:11:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457137805] [2024-11-19 11:11:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:11:54,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:54,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:11:54,972 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:11:54,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 11:11:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:11:55,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 11:11:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:11:55,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 11:11:55,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 11:11:55,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2024-11-19 11:11:55,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2024-11-19 11:11:55,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2024-11-19 11:11:55,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2024-11-19 11:11:55,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2024-11-19 11:11:55,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2024-11-19 11:11:55,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2024-11-19 11:11:55,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2024-11-19 11:11:55,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2024-11-19 11:11:55,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2024-11-19 11:11:55,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2024-11-19 11:11:55,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2024-11-19 11:11:55,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2024-11-19 11:11:55,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err32ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2024-11-19 11:11:55,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2024-11-19 11:11:55,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2024-11-19 11:11:55,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2024-11-19 11:11:55,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2024-11-19 11:11:55,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2024-11-19 11:11:55,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err38ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2024-11-19 11:11:55,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2024-11-19 11:11:55,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err40ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2024-11-19 11:11:55,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err41ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2024-11-19 11:11:55,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2024-11-19 11:11:55,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2024-11-19 11:11:55,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err44ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2024-11-19 11:11:55,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2024-11-19 11:11:55,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err46ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2024-11-19 11:11:55,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err47ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2024-11-19 11:11:55,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2024-11-19 11:11:55,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2024-11-19 11:11:55,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2024-11-19 11:11:55,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err51ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2024-11-19 11:11:55,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2024-11-19 11:11:55,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2024-11-19 11:11:55,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2024-11-19 11:11:55,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2024-11-19 11:11:55,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2024-11-19 11:11:55,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2024-11-19 11:11:55,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2024-11-19 11:11:55,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2024-11-19 11:11:55,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2024-11-19 11:11:55,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2024-11-19 11:11:55,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2024-11-19 11:11:55,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2024-11-19 11:11:55,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2024-11-19 11:11:55,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2024-11-19 11:11:55,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2024-11-19 11:11:55,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2024-11-19 11:11:55,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2024-11-19 11:11:55,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2024-11-19 11:11:55,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2024-11-19 11:11:55,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2024-11-19 11:11:55,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2024-11-19 11:11:55,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2024-11-19 11:11:55,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2024-11-19 11:11:55,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2024-11-19 11:11:55,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2024-11-19 11:11:55,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2024-11-19 11:11:55,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2024-11-19 11:11:55,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2024-11-19 11:11:55,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2024-11-19 11:11:55,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2024-11-19 11:11:55,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2024-11-19 11:11:55,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2024-11-19 11:11:55,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2024-11-19 11:11:55,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2024-11-19 11:11:55,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2024-11-19 11:11:55,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2024-11-19 11:11:55,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2024-11-19 11:11:55,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2024-11-19 11:11:55,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2024-11-19 11:11:55,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2024-11-19 11:11:55,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2024-11-19 11:11:55,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2024-11-19 11:11:55,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2024-11-19 11:11:55,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2024-11-19 11:11:55,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2024-11-19 11:11:55,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2024-11-19 11:11:55,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2024-11-19 11:11:55,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2024-11-19 11:11:55,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2024-11-19 11:11:55,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2024-11-19 11:11:55,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2024-11-19 11:11:55,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2024-11-19 11:11:55,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 11:11:55,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:11:55,461 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 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-19 11:11:55,544 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:11:55,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:11:55 BoogieIcfgContainer [2024-11-19 11:11:55,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:11:55,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:11:55,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:11:55,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:11:55,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:11:21" (3/4) ... [2024-11-19 11:11:55,550 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 11:11:55,605 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 11:11:55,605 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:11:55,605 INFO L158 Benchmark]: Toolchain (without parser) took 35710.53ms. Allocated memory was 151.0MB in the beginning and 377.5MB in the end (delta: 226.5MB). Free memory was 79.9MB in the beginning and 234.9MB in the end (delta: -155.0MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2024-11-19 11:11:55,605 INFO L158 Benchmark]: CDTParser took 1.61ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:11:55,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.35ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 66.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 11:11:55,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.79ms. Allocated memory is still 151.0MB. Free memory was 65.8MB in the beginning and 119.7MB in the end (delta: -53.9MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-19 11:11:55,606 INFO L158 Benchmark]: Boogie Preprocessor took 111.13ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 119.7MB in the beginning and 173.8MB in the end (delta: -54.1MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-11-19 11:11:55,606 INFO L158 Benchmark]: RCFGBuilder took 1198.44ms. Allocated memory is still 203.4MB. Free memory was 173.8MB in the beginning and 124.5MB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-19 11:11:55,606 INFO L158 Benchmark]: TraceAbstraction took 33922.57ms. Allocated memory was 203.4MB in the beginning and 377.5MB in the end (delta: 174.1MB). Free memory was 123.5MB in the beginning and 242.2MB in the end (delta: -118.7MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2024-11-19 11:11:55,606 INFO L158 Benchmark]: Witness Printer took 56.60ms. Allocated memory is still 377.5MB. Free memory was 242.2MB in the beginning and 234.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 11:11:55,608 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.61ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.35ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 66.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.79ms. Allocated memory is still 151.0MB. Free memory was 65.8MB in the beginning and 119.7MB in the end (delta: -53.9MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.13ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 119.7MB in the beginning and 173.8MB in the end (delta: -54.1MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1198.44ms. Allocated memory is still 203.4MB. Free memory was 173.8MB in the beginning and 124.5MB in the end (delta: 49.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 33922.57ms. Allocated memory was 203.4MB in the beginning and 377.5MB in the end (delta: 174.1MB). Free memory was 123.5MB in the beginning and 242.2MB in the end (delta: -118.7MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * Witness Printer took 56.60ms. Allocated memory is still 377.5MB. Free memory was 242.2MB in the beginning and 234.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 94]: integer overflow possible integer overflow possible We found a FailurePath: [L82] int a; [L83] int n; [L84] int x; [L85] int y; [L86] int z; [L87] a = __VERIFIER_nondet_int() [L88] n = 0 [L89] x = 0 [L90] y = 1 [L91] z = 6 [L92] CALL func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}] [L56] EXPR \read(*z) [L56] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L56] EXPR 6 * (*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L56] EXPR (6 * (*n)) + 6 VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L56] CALL __VERIFIER_assert((*z) == ((6 * (*n)) + 6)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L56] RET __VERIFIER_assert((*z) == ((6 * (*n)) + 6)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L57] EXPR \read(*y) [L57] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L57] EXPR 3 * (*n) [L57] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L57] EXPR (3 * (*n)) * (*n) [L57] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L57] EXPR 3 * (*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L57] EXPR ((3 * (*n)) * (*n)) + (3 * (*n)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L57] EXPR (((3 * (*n)) * (*n)) + (3 * (*n))) + 1 VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L57] CALL __VERIFIER_assert((*y) == ((((3 * (*n)) * (*n)) + (3 * (*n))) + 1)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET __VERIFIER_assert((*y) == ((((3 * (*n)) * (*n)) + (3 * (*n))) + 1)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L58] EXPR \read(*x) [L58] EXPR \read(*n) [L58] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L58] EXPR (*n) * (*n) [L58] EXPR \read(*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L58] EXPR ((*n) * (*n)) * (*n) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L58] CALL __VERIFIER_assert((*x) == (((*n) * (*n)) * (*n))) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET __VERIFIER_assert((*x) == (((*n) * (*n)) * (*n))) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR \read(*y) [L59] EXPR \read(*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR (*y) * (*z) [L59] EXPR \read(*x) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR 18 * (*x) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR ((*y) * (*z)) - (18 * (*x)) [L59] EXPR \read(*y) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR 12 * (*y) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR (((*y) * (*z)) - (18 * (*x))) - (12 * (*y)) [L59] EXPR \read(*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR 2 * (*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR ((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] EXPR (((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6 VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L59] CALL __VERIFIER_assert(((((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L59] RET __VERIFIER_assert(((((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6) == 0) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L60] EXPR \read(*z) [L60] EXPR \read(*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L60] EXPR (*z) * (*z) [L60] EXPR \read(*y) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L60] EXPR 12 * (*y) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L60] EXPR ((*z) * (*z)) - (12 * (*y)) [L60] EXPR \read(*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L60] EXPR 6 * (*z) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L60] EXPR (((*z) * (*z)) - (12 * (*y))) - (6 * (*z)) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L60] EXPR ((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12 VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L60] CALL __VERIFIER_assert((((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert((((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12) == 0) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L61] EXPR \read(*n) [L61] EXPR \read(*a) VAL [\old(a)={7:0}, \old(n)={6:0}, \old(x)={8:0}, \old(y)={5:0}, \old(z)={4:0}, a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L61] COND TRUE !((*n) <= (*a)) [L92] RET func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [a={7:0}, n={6:0}, x={8:0}, y={5:0}, z={4:0}] [L93] EXPR \read(z) [L93] EXPR \read(n) [L93] EXPR 6 * n VAL [a={7:0}, x={8:0}, y={5:0}, z={4:0}] [L93] EXPR (6 * n) + 6 VAL [a={7:0}, x={8:0}, y={5:0}, z={4:0}] [L93] CALL __VERIFIER_assert(z == ((6 * n) + 6)) [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(z == ((6 * n) + 6)) VAL [a={7:0}, x={8:0}, y={5:0}, z={4:0}] [L94] EXPR \read(a) [L94] 6 * a VAL [a={7:0}, x={8:0}, y={5:0}, z={4:0}] - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 317 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 33.8s, OverallIterations: 30, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 10089 SdHoareTripleChecker+Valid, 15.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9998 mSDsluCounter, 49889 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41506 mSDsCounter, 498 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7475 IncrementalHoareTripleChecker+Invalid, 7975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 498 mSolverCounterUnsat, 8383 mSDtfsCounter, 7475 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 718 SyntacticMatches, 66 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=29, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 2519 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 2441 NumberOfCodeBlocks, 2441 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2000 ConstructedInterpolants, 172 QuantifiedInterpolants, 16661 SizeOfPredicates, 115 NumberOfNonLiveVariables, 2590 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 34 InterpolantComputations, 24 PerfectInterpolantSequences, 704/733 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-19 11:11:55,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)