./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 53d776429169be2026863283cb18a34602ad7ee3b29f4a2a38a6e26dad3008de --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:30:26,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:30:26,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:30:26,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:30:26,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:30:26,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:30:26,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:30:26,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:30:26,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:30:26,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:30:26,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:30:26,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:30:26,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:30:26,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:30:26,661 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:30:26,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:30:26,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:30:26,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:30:26,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:30:26,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:30:26,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:30:26,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:30:26,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:30:26,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:30:26,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:30:26,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:30:26,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:30:26,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:30:26,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:30:26,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:30:26,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:30:26,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:30:26,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:30:26,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:30:26,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:30:26,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:30:26,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:30:26,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:30:26,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:30:26,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:30:26,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:30:26,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:30:26,674 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 53d776429169be2026863283cb18a34602ad7ee3b29f4a2a38a6e26dad3008de Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:30:27,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:30:27,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:30:27,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:30:27,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:30:27,040 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:30:27,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2024-09-25 11:30:28,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:30:28,692 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:30:28,693 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2024-09-25 11:30:28,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/59bcbea53/fb28d314e255428088b7bddd330ec9fa/FLAGec17b6d24 [2024-09-25 11:30:29,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/59bcbea53/fb28d314e255428088b7bddd330ec9fa [2024-09-25 11:30:29,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:30:29,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:30:29,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:30:29,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:30:29,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:30:29,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b67be15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29, skipping insertion in model container [2024-09-25 11:30:29,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:30:29,247 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2024-09-25 11:30:29,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:30:29,277 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:30:29,288 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2024-09-25 11:30:29,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:30:29,320 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:30:29,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29 WrapperNode [2024-09-25 11:30:29,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:30:29,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:30:29,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:30:29,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:30:29,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,342 INFO L138 Inliner]: procedures = 14, calls = 30, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:30:29,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:30:29,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:30:29,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:30:29,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:30:29,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,387 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 5, 4, 5]. 31 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-09-25 11:30:29,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:30:29,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:30:29,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:30:29,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:30:29,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (1/1) ... [2024-09-25 11:30:29,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:30:29,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:29,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 11:30:29,438 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 11:30:29,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:30:29,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:30:29,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:30:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:30:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:30:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 11:30:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-25 11:30:29,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 11:30:29,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 11:30:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 11:30:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 11:30:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-25 11:30:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:30:29,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:30:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:30:29,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:30:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 11:30:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 11:30:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 11:30:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-25 11:30:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_24_0 [2024-09-25 11:30:29,487 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_24_0 [2024-09-25 11:30:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:30:29,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:30:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:30:29,581 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:30:29,583 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:30:29,758 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-25 11:30:29,758 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:30:29,774 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:30:29,775 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:30:29,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:30:29 BoogieIcfgContainer [2024-09-25 11:30:29,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:30:29,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:30:29,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:30:29,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:30:29,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:30:29" (1/3) ... [2024-09-25 11:30:29,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e330d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:30:29, skipping insertion in model container [2024-09-25 11:30:29,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:29" (2/3) ... [2024-09-25 11:30:29,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e330d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:30:29, skipping insertion in model container [2024-09-25 11:30:29,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:30:29" (3/3) ... [2024-09-25 11:30:29,785 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_2.c [2024-09-25 11:30:29,801 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:30:29,801 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:30:29,858 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:30:29,865 INFO L336 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=All, 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;@1910e605, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:30:29,866 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:30:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 11:30:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 11:30:29,878 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:29,878 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:29,879 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:29,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 29560559, now seen corresponding path program 1 times [2024-09-25 11:30:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656579776] [2024-09-25 11:30:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:30:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656579776] [2024-09-25 11:30:30,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656579776] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:30:30,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:30:30,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 11:30:30,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222230919] [2024-09-25 11:30:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:30:30,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 11:30:30,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:30,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 11:30:30,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:30:30,859 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:30:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:30,971 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-09-25 11:30:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:30:30,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-25 11:30:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:30,979 INFO L225 Difference]: With dead ends: 45 [2024-09-25 11:30:30,980 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 11:30:30,983 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:30:30,988 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:30,989 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:30:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 11:30:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-25 11:30:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:30:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-25 11:30:31,025 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 13 [2024-09-25 11:30:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:31,026 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-25 11:30:31,026 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:30:31,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-25 11:30:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 11:30:31,028 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:31,028 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:31,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:30:31,029 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:31,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 27713517, now seen corresponding path program 1 times [2024-09-25 11:30:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190293375] [2024-09-25 11:30:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:31,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:30:31,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190293375] [2024-09-25 11:30:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190293375] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:30:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:30:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-25 11:30:31,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324684939] [2024-09-25 11:30:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:30:31,629 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 11:30:31,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:31,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 11:30:31,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-25 11:30:31,630 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:30:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:31,801 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-09-25 11:30:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:30:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-25 11:30:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:31,806 INFO L225 Difference]: With dead ends: 30 [2024-09-25 11:30:31,806 INFO L226 Difference]: Without dead ends: 28 [2024-09-25 11:30:31,807 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:30:31,807 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:31,808 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 75 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:30:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-25 11:30:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-09-25 11:30:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 11:30:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-09-25 11:30:31,823 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2024-09-25 11:30:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:31,823 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-09-25 11:30:31,824 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:30:31,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-09-25 11:30:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 11:30:31,826 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:31,826 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:31,827 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:30:31,827 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:31,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1901587865, now seen corresponding path program 1 times [2024-09-25 11:30:31,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:31,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448847186] [2024-09-25 11:30:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:31,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:32,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:32,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 11:30:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:30:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448847186] [2024-09-25 11:30:32,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448847186] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082427656] [2024-09-25 11:30:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:32,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:32,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:32,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:30:32,654 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 11:30:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:32,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-09-25 11:30:32,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:33,036 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 19 treesize of output 11 [2024-09-25 11:30:33,048 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 19 treesize of output 11 [2024-09-25 11:30:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:30:33,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:30:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:30:33,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082427656] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:30:33,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:30:33,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 6] total 19 [2024-09-25 11:30:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569832066] [2024-09-25 11:30:33,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:30:33,487 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 11:30:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 11:30:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:30:33,489 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 19 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 11:30:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:33,722 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-09-25 11:30:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 11:30:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2024-09-25 11:30:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:33,724 INFO L225 Difference]: With dead ends: 42 [2024-09-25 11:30:33,724 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 11:30:33,724 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:30:33,725 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:33,726 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:30:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 11:30:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-09-25 11:30:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 11:30:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-09-25 11:30:33,734 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2024-09-25 11:30:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:33,735 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-09-25 11:30:33,735 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 11:30:33,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-09-25 11:30:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 11:30:33,736 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:33,736 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:33,755 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:30:33,940 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:33,941 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:33,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:33,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1903434907, now seen corresponding path program 1 times [2024-09-25 11:30:33,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916089980] [2024-09-25 11:30:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:33,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:34,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:34,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 11:30:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:30:34,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:34,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916089980] [2024-09-25 11:30:34,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916089980] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:34,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830616281] [2024-09-25 11:30:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:34,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:34,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:30:34,634 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 11:30:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:34,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-09-25 11:30:34,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:34,994 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 19 treesize of output 11 [2024-09-25 11:30:34,999 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 19 treesize of output 11 [2024-09-25 11:30:35,253 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 19 treesize of output 11 [2024-09-25 11:30:35,258 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 19 treesize of output 11 [2024-09-25 11:30:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:30:35,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:30:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:30:35,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830616281] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:30:35,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:30:35,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 10] total 28 [2024-09-25 11:30:35,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677932312] [2024-09-25 11:30:35,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:30:35,710 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-25 11:30:35,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:35,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-25 11:30:35,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2024-09-25 11:30:35,712 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 28 states, 24 states have (on average 1.625) internal successors, (39), 20 states have internal predecessors, (39), 9 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 11:30:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:36,194 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-09-25 11:30:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-25 11:30:36,195 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.625) internal successors, (39), 20 states have internal predecessors, (39), 9 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2024-09-25 11:30:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:36,196 INFO L225 Difference]: With dead ends: 34 [2024-09-25 11:30:36,196 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:30:36,197 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 11:30:36,197 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:36,198 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 127 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:30:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:30:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:30:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 11:30:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:30:36,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-09-25 11:30:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:36,199 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:30:36,199 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.625) internal successors, (39), 20 states have internal predecessors, (39), 9 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 11:30:36,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:30:36,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:30:36,202 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:30:36,220 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 11:30:36,406 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:36,410 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-25 11:30:36,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:30:37,894 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:30:37,905 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:30:37,906 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:30:37,907 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:30:37,907 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:30:37,938 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_24_0 contained old-variable. Original clause: (let ((.cse1 (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~i.base|)) (.cse4 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~k.base|)) (.cse2 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~k.base|))) (let ((.cse7 (select .cse2 |func_to_recursive_line_20_to_24_0_#in~k.offset|)) (.cse6 (select .cse4 |func_to_recursive_line_20_to_24_0_#in~k.offset|)) (.cse8 (select .cse1 |func_to_recursive_line_20_to_24_0_#in~i.offset|)) (.cse0 (select (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~j.base|) |func_to_recursive_line_20_to_24_0_#in~j.offset|)) (.cse5 (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~j.base|) |func_to_recursive_line_20_to_24_0_#in~j.offset|)) (.cse3 (select (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~i.base|) |func_to_recursive_line_20_to_24_0_#in~i.offset|))) (and (or (and (= 0 .cse0) (= (select .cse1 0) 0) (= (select .cse2 0) 0)) (not (= |func_to_recursive_line_20_to_24_0_#in~k.offset| 0)) (not (= .cse3 0)) (not (= (select .cse4 0) 0)) (not (= 0 |func_to_recursive_line_20_to_24_0_#in~i.offset|)) (not (= .cse5 0))) (or (not (= .cse5 2)) (not (= .cse3 1)) (not (= .cse6 3)) (and (= .cse7 3) (= .cse8 1) (= 2 .cse0))) (= (mod (+ .cse7 3) 4294967296) (mod (+ 3 (* .cse8 3)) 4294967296)) (= (mod (+ .cse6 3) 4294967296) (mod (+ (* 3 .cse3) 3) 4294967296)) (= (* (mod .cse8 2147483648) 2) (mod .cse0 4294967296)) (= (mod .cse5 4294967296) (* (mod .cse3 2147483648) 2))))) Eliminated clause: (let ((.cse7 (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~i.base|)) (.cse8 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~k.base|))) (let ((.cse0 (select .cse8 |func_to_recursive_line_20_to_24_0_#in~k.offset|)) (.cse1 (select .cse7 |func_to_recursive_line_20_to_24_0_#in~i.offset|)) (.cse2 (select (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~j.base|) |func_to_recursive_line_20_to_24_0_#in~j.offset|))) (and (= (mod (+ .cse0 3) 4294967296) (mod (+ 3 (* .cse1 3)) 4294967296)) (= (* (mod .cse1 2147483648) 2) (mod .cse2 4294967296)) (exists ((|old(#memory_int#1)| (Array Int (Array Int Int))) (|old(#memory_int#3)| (Array Int (Array Int Int))) (|old(#memory_int#2)| (Array Int (Array Int Int)))) (let ((.cse6 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~i.base|)) (.cse9 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~k.base|))) (let ((.cse5 (select .cse9 |func_to_recursive_line_20_to_24_0_#in~k.offset|)) (.cse3 (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~j.base|) |func_to_recursive_line_20_to_24_0_#in~j.offset|)) (.cse4 (select .cse6 |func_to_recursive_line_20_to_24_0_#in~i.offset|))) (and (or (not (= .cse3 2)) (not (= .cse4 1)) (not (= .cse5 3)) (and (= .cse0 3) (= .cse1 1) (= 2 .cse2))) (or (not (= (select .cse6 0) 0)) (and (= 0 .cse2) (= (select .cse7 0) 0) (= (select .cse8 0) 0)) (not (= |func_to_recursive_line_20_to_24_0_#in~k.offset| 0)) (not (= (select .cse9 0) 0)) (not (= 0 |func_to_recursive_line_20_to_24_0_#in~i.offset|)) (not (= .cse3 0))) (= (mod (+ .cse5 3) 4294967296) (mod (+ (* 3 .cse4) 3) 4294967296)) (= (mod .cse3 4294967296) (* (mod .cse4 2147483648) 2))))))))) [2024-09-25 11:30:37,941 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:30:37,946 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-25 11:30:37,946 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~k!base,]]] [2024-09-25 11:30:37,946 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~j!base,]]] [2024-09-25 11:30:37,947 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 11:30:37,948 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:30:37,948 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:30:37,948 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:30:37,948 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:30:37,948 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:30:37,949 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:30:37,949 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:30:37,949 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-25 11:30:37,949 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~k!base,]]] [2024-09-25 11:30:37,951 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-09-25 11:30:37,951 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-09-25 11:30:37,951 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-09-25 11:30:37,951 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:30:37,951 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-25 11:30:37,952 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~j!base,]]] [2024-09-25 11:30:37,952 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-09-25 11:30:37,952 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-09-25 11:30:37,952 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-09-25 11:30:37,952 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:30:37,952 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:30:37,954 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:30:37,954 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:30:37,955 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:30:37,955 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:30:37,955 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:30:37,955 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:30:37,955 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:30:37,956 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:30:37,956 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:30:37,956 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:30:37,957 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:30:37,957 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:30:37,957 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-09-25 11:30:37,957 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-09-25 11:30:37,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:30:37 BoogieIcfgContainer [2024-09-25 11:30:37,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:30:37,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:30:37,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:30:37,960 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:30:37,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:30:29" (3/4) ... [2024-09-25 11:30:37,963 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:30:38,010 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:30:38,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:30:38,011 INFO L158 Benchmark]: Toolchain (without parser) took 8938.24ms. Allocated memory was 71.3MB in the beginning and 157.3MB in the end (delta: 86.0MB). Free memory was 47.1MB in the beginning and 122.6MB in the end (delta: -75.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-09-25 11:30:38,011 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:30:38,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.58ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 35.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 11:30:38,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.08ms. Allocated memory is still 71.3MB. Free memory was 35.5MB in the beginning and 34.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:30:38,012 INFO L158 Benchmark]: Boogie Preprocessor took 57.46ms. Allocated memory is still 71.3MB. Free memory was 34.5MB in the beginning and 50.8MB in the end (delta: -16.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-09-25 11:30:38,012 INFO L158 Benchmark]: RCFGBuilder took 374.86ms. Allocated memory is still 71.3MB. Free memory was 50.8MB in the beginning and 36.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 11:30:38,012 INFO L158 Benchmark]: TraceAbstraction took 8180.73ms. Allocated memory was 71.3MB in the beginning and 157.3MB in the end (delta: 86.0MB). Free memory was 35.8MB in the beginning and 125.8MB in the end (delta: -90.0MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-09-25 11:30:38,013 INFO L158 Benchmark]: Witness Printer took 51.22ms. Allocated memory is still 157.3MB. Free memory was 125.8MB in the beginning and 122.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:30:38,014 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.18ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.58ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 35.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.08ms. Allocated memory is still 71.3MB. Free memory was 35.5MB in the beginning and 34.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.46ms. Allocated memory is still 71.3MB. Free memory was 34.5MB in the beginning and 50.8MB in the end (delta: -16.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * RCFGBuilder took 374.86ms. Allocated memory is still 71.3MB. Free memory was 50.8MB in the beginning and 36.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8180.73ms. Allocated memory was 71.3MB in the beginning and 157.3MB in the end (delta: 86.0MB). Free memory was 35.8MB in the beginning and 125.8MB in the end (delta: -90.0MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * Witness Printer took 51.22ms. Allocated memory is still 157.3MB. Free memory was 125.8MB in the beginning and 122.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~k!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~j!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~k!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~j!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 337 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 469 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 58 mSDtfsCounter, 469 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 48, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 156 ConstructedInterpolants, 11 QuantifiedInterpolants, 1443 SizeOfPredicates, 38 NumberOfNonLiveVariables, 405 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 17/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 20]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:30:38,045 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE