./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c117c02695ddb101583ad96117955e242a853299846ac846441a25e3775ce242 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:16:31,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:16:31,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:16:31,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:16:31,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:16:31,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:16:31,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:16:31,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:16:31,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:16:31,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:16:31,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:16:31,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:16:31,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:16:31,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:16:31,331 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:16:31,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:16:31,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:16:31,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:16:31,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:16:31,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:16:31,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:16:31,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:16:31,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:16:31,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:16:31,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:16:31,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:16:31,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:16:31,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:16:31,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:16:31,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:16:31,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:16:31,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:16:31,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:16:31,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:16:31,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:16:31,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:16:31,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:16:31,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:16:31,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:16:31,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:16:31,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:16:31,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:16:31,338 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c117c02695ddb101583ad96117955e242a853299846ac846441a25e3775ce242 [2024-10-14 03:16:31,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:16:31,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:16:31,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:16:31,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:16:31,573 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:16:31,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c [2024-10-14 03:16:32,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:16:32,855 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:16:32,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c [2024-10-14 03:16:32,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5cbf811/b916e2dc851a47debc997e13fc9685ed/FLAG011d36b48 [2024-10-14 03:16:33,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5cbf811/b916e2dc851a47debc997e13fc9685ed [2024-10-14 03:16:33,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:16:33,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:16:33,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:16:33,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:16:33,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:16:33,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8f0b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33, skipping insertion in model container [2024-10-14 03:16:33,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:16:33,462 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c[1476,1489] [2024-10-14 03:16:33,468 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c[1549,1562] [2024-10-14 03:16:33,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:16:33,480 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:16:33,494 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c[1476,1489] [2024-10-14 03:16:33,495 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-b.c[1549,1562] [2024-10-14 03:16:33,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:16:33,514 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:16:33,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33 WrapperNode [2024-10-14 03:16:33,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:16:33,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:16:33,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:16:33,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:16:33,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,543 INFO L138 Inliner]: procedures = 13, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2024-10-14 03:16:33,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:16:33,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:16:33,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:16:33,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:16:33,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,569 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 3, 5, 4, 4]. 28 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 3 writes are split as follows [0, 0, 1, 1, 1]. [2024-10-14 03:16:33,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:16:33,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:16:33,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:16:33,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:16:33,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (1/1) ... [2024-10-14 03:16:33,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:16:33,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:16:33,608 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-10-14 03:16:33,615 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-10-14 03:16:33,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:16:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:16:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 03:16:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 03:16:33,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 03:16:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 03:16:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 03:16:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 03:16:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 03:16:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 03:16:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 03:16:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 03:16:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:16:33,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:16:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 03:16:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 03:16:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 03:16:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 03:16:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 03:16:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 03:16:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_15_0 [2024-10-14 03:16:33,650 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_15_0 [2024-10-14 03:16:33,731 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:16:33,734 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:16:33,886 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-14 03:16:33,886 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:16:33,921 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:16:33,922 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:16:33,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:16:33 BoogieIcfgContainer [2024-10-14 03:16:33,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:16:33,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:16:33,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:16:33,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:16:33,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:16:33" (1/3) ... [2024-10-14 03:16:33,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72906c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:16:33, skipping insertion in model container [2024-10-14 03:16:33,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:16:33" (2/3) ... [2024-10-14 03:16:33,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72906c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:16:33, skipping insertion in model container [2024-10-14 03:16:33,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:16:33" (3/3) ... [2024-10-14 03:16:33,929 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_linear-inequality-inv-b.c [2024-10-14 03:16:33,959 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:16:33,959 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 03:16:34,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:16:34,009 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;@398617a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:16:34,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 03:16:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:16:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 03:16:34,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:16:34,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:16:34,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:16:34,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:16:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash 947785726, now seen corresponding path program 1 times [2024-10-14 03:16:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:16:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509724734] [2024-10-14 03:16:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:16:34,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:16:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:16:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:16:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:16:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:16:34,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:16:34,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509724734] [2024-10-14 03:16:34,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509724734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:16:34,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:16:34,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:16:34,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023601153] [2024-10-14 03:16:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:16:34,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:16:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:16:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:16:34,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:16:34,550 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:16:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:16:34,625 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-10-14 03:16:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:16:34,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-14 03:16:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:16:34,633 INFO L225 Difference]: With dead ends: 25 [2024-10-14 03:16:34,633 INFO L226 Difference]: Without dead ends: 14 [2024-10-14 03:16:34,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:16:34,639 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:16:34,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:16:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-14 03:16:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-14 03:16:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:16:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-14 03:16:34,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-10-14 03:16:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:16:34,666 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-14 03:16:34,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:16:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-14 03:16:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 03:16:34,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:16:34,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:16:34,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:16:34,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:16:34,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:16:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1341401249, now seen corresponding path program 1 times [2024-10-14 03:16:34,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:16:34,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567048976] [2024-10-14 03:16:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:16:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:16:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:16:35,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:16:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:16:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:16:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:16:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:16:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:16:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567048976] [2024-10-14 03:16:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567048976] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:16:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071355186] [2024-10-14 03:16:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:16:35,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:16:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:16:35,436 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-10-14 03:16:35,439 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-10-14 03:16:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:16:35,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 03:16:35,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:16:35,618 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-10-14 03:16:35,685 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 25 treesize of output 17 [2024-10-14 03:16:35,717 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 21 treesize of output 13 [2024-10-14 03:16:35,721 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-10-14 03:16:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:16:35,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:16:36,149 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 43 treesize of output 31 [2024-10-14 03:16:40,315 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 144 treesize of output 136 [2024-10-14 03:16:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:16:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071355186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:16:40,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:16:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2024-10-14 03:16:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469384485] [2024-10-14 03:16:40,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:16:40,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 03:16:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:16:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 03:16:40,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=322, Unknown=1, NotChecked=0, Total=380 [2024-10-14 03:16:40,745 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 20 states, 17 states have (on average 1.411764705882353) internal successors, (24), 15 states have internal predecessors, (24), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 03:16:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:16:41,042 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-14 03:16:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:16:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.411764705882353) internal successors, (24), 15 states have internal predecessors, (24), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 15 [2024-10-14 03:16:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:16:41,043 INFO L225 Difference]: With dead ends: 24 [2024-10-14 03:16:41,043 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 03:16:41,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=119, Invalid=530, Unknown=1, NotChecked=0, Total=650 [2024-10-14 03:16:41,044 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:16:41,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 47 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:16:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 03:16:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 03:16:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:16:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-10-14 03:16:41,049 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2024-10-14 03:16:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:16:41,049 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-10-14 03:16:41,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.411764705882353) internal successors, (24), 15 states have internal predecessors, (24), 5 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 03:16:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-10-14 03:16:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 03:16:41,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:16:41,052 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:16:41,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:16:41,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:16:41,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:16:41,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:16:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2114283542, now seen corresponding path program 2 times [2024-10-14 03:16:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:16:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689431512] [2024-10-14 03:16:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:16:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:16:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:16:41,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:16:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:16:41,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:16:41,315 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:16:41,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-14 03:16:41,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-14 03:16:41,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:16:41,319 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-14 03:16:41,356 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:16:41,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:16:41 BoogieIcfgContainer [2024-10-14 03:16:41,360 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:16:41,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:16:41,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:16:41,362 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:16:41,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:16:33" (3/4) ... [2024-10-14 03:16:41,362 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:16:41,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:16:41,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:16:41,401 INFO L158 Benchmark]: Toolchain (without parser) took 8113.86ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 109.6MB in the beginning and 90.5MB in the end (delta: 19.1MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-10-14 03:16:41,401 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:16:41,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.86ms. Allocated memory is still 186.6MB. Free memory was 109.4MB in the beginning and 151.6MB in the end (delta: -42.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-14 03:16:41,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.14ms. Allocated memory is still 186.6MB. Free memory was 151.6MB in the beginning and 149.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:16:41,402 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:16:41,402 INFO L158 Benchmark]: RCFGBuilder took 344.02ms. Allocated memory is still 186.6MB. Free memory was 147.4MB in the beginning and 155.0MB in the end (delta: -7.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 03:16:41,402 INFO L158 Benchmark]: TraceAbstraction took 7435.65ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 155.0MB in the beginning and 93.6MB in the end (delta: 61.3MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2024-10-14 03:16:41,402 INFO L158 Benchmark]: Witness Printer took 39.12ms. Allocated memory is still 239.1MB. Free memory was 93.6MB in the beginning and 90.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 03:16:41,403 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.86ms. Allocated memory is still 186.6MB. Free memory was 109.4MB in the beginning and 151.6MB in the end (delta: -42.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.14ms. Allocated memory is still 186.6MB. Free memory was 151.6MB in the beginning and 149.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.02ms. Allocated memory is still 186.6MB. Free memory was 147.4MB in the beginning and 155.0MB in the end (delta: -7.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7435.65ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 155.0MB in the beginning and 93.6MB in the end (delta: 61.3MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. * Witness Printer took 39.12ms. Allocated memory is still 239.1MB. Free memory was 93.6MB in the beginning and 90.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] unsigned char n = __VERIFIER_nondet_uchar(); [L38] unsigned char n = __VERIFIER_nondet_uchar(); [L39] EXPR \read(n) [L39] COND FALSE !(n == 0) [L46] unsigned char v = 0; [L46] unsigned char v = 0; [L47] unsigned char s = 0; [L47] unsigned char s = 0; [L48] unsigned int i = 0; [L48] unsigned int i = 0; [L49] CALL func_to_recursive_line_12_to_15_0(&v, &n, &s, &i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L22] COND TRUE (*i) < (*n) [L25] *v = __VERIFIER_nondet_uchar() [L26] EXPR \read(*s) [L26] EXPR \read(*v) [L26] *s += *v [L27] EXPR \read(*i) [L27] ++(*i) [L27] ++(*i) [L29] CALL func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L22] COND TRUE (*i) < (*n) [L25] *v = __VERIFIER_nondet_uchar() [L26] EXPR \read(*s) [L26] EXPR \read(*v) [L26] *s += *v [L27] EXPR \read(*i) [L27] ++(*i) [L27] ++(*i) [L29] CALL func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}] [L22] EXPR \read(*i) [L22] EXPR \read(*n) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L22] COND FALSE !((*i) < (*n)) [L29] RET func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L29] RET func_to_recursive_line_12_to_15_0(v, n, s, i) VAL [\old(i)={5:0}, \old(n)={6:0}, \old(s)={7:0}, \old(v)={8:0}, i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L49] RET func_to_recursive_line_12_to_15_0(&v, &n, &s, &i) VAL [i={5:0}, n={6:0}, s={7:0}, v={8:0}] [L50] EXPR \read(s) [L50] EXPR \read(v) [L50] COND TRUE s < v [L52] reach_error() VAL [i={5:0}, n={6:0}, s={7:0}] - UnprovableResult [Line: 60]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 17 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 51 ConstructedInterpolants, 5 QuantifiedInterpolants, 1520 SizeOfPredicates, 10 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2/12 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-10-14 03:16:41,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE