./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_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-simple/recursified_nested_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 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --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:31:31,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:31:31,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:31:31,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:31:31,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:31:31,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:31:31,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:31:31,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:31:31,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:31:31,536 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:31:31,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:31:31,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:31:31,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:31:31,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:31:31,539 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:31:31,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:31:31,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:31:31,540 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:31:31,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:31:31,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:31:31,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:31:31,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:31:31,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:31:31,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:31:31,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:31:31,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:31:31,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:31:31,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:31:31,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:31:31,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:31:31,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:31:31,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:31:31,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:31:31,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:31:31,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:31:31,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:31:31,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:31:31,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:31:31,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:31:31,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:31:31,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:31:31,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:31:31,560 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b 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:31:31,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:31:31,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:31:31,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:31:31,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:31:31,885 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:31:31,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-09-25 11:31:33,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:31:33,608 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:31:33,609 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-09-25 11:31:33,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8d21a2354/9997ac0549b143e38015050555976861/FLAG03b404f04 [2024-09-25 11:31:33,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8d21a2354/9997ac0549b143e38015050555976861 [2024-09-25 11:31:33,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:31:33,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:31:33,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:31:33,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:31:33,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:31:33,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc7b1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33, skipping insertion in model container [2024-09-25 11:31:33,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:31:33,827 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-simple/recursified_nested_2.c[1611,1624] [2024-09-25 11:31:33,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:31:33,848 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:31:33,872 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-simple/recursified_nested_2.c[1611,1624] [2024-09-25 11:31:33,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:31:33,890 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:31:33,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33 WrapperNode [2024-09-25 11:31:33,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:31:33,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:31:33,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:31:33,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:31:33,899 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:31:33" (1/1) ... [2024-09-25 11:31:33,906 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:31:33" (1/1) ... [2024-09-25 11:31:33,913 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:31:33,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:31:33,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:31:33,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:31:33,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:31:33,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,947 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-09-25 11:31:33,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:31:33,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:31:33,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:31:33,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:31:33,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (1/1) ... [2024-09-25 11:31:33,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:31:33,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:31:34,003 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:31:34,007 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:31:34,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:31:34,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:31:34,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:31:34,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:31:34,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:31:34,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 11:31:34,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 11:31:34,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 11:31:34,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 11:31:34,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 11:31:34,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:31:34,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:31:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-09-25 11:31:34,055 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-09-25 11:31:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:31:34,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:31:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 11:31:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 11:31:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 11:31:34,057 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-09-25 11:31:34,057 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-09-25 11:31:34,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:31:34,153 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:31:34,155 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:31:34,334 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 11:31:34,335 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:31:34,357 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:31:34,358 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:31:34,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:31:34 BoogieIcfgContainer [2024-09-25 11:31:34,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:31:34,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:31:34,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:31:34,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:31:34,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:31:33" (1/3) ... [2024-09-25 11:31:34,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357e3774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:31:34, skipping insertion in model container [2024-09-25 11:31:34,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:31:33" (2/3) ... [2024-09-25 11:31:34,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357e3774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:31:34, skipping insertion in model container [2024-09-25 11:31:34,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:31:34" (3/3) ... [2024-09-25 11:31:34,374 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-09-25 11:31:34,390 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:31:34,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:31:34,450 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:31:34,458 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;@43251957, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:31:34,459 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:31:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 11:31:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 11:31:34,470 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:34,471 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:34,471 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:34,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1880927793, now seen corresponding path program 1 times [2024-09-25 11:31:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:34,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429583753] [2024-09-25 11:31:34,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:34,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:34,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:35,037 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:31:35,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:35,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429583753] [2024-09-25 11:31:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429583753] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:31:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:31:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 11:31:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000112404] [2024-09-25 11:31:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:31:35,045 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 11:31:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:31:35,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 11:31:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:31:35,067 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:31:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:31:35,270 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-09-25 11:31:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:31:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-09-25 11:31:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:31:35,282 INFO L225 Difference]: With dead ends: 40 [2024-09-25 11:31:35,282 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 11:31:35,285 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:31:35,289 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:31:35,290 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:31:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 11:31:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-09-25 11:31:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-25 11:31:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-25 11:31:35,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2024-09-25 11:31:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:31:35,338 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-25 11:31:35,338 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:31:35,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-25 11:31:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 11:31:35,341 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:35,341 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:35,341 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:31:35,342 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:35,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash 259605890, now seen corresponding path program 1 times [2024-09-25 11:31:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936982886] [2024-09-25 11:31:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:35,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:35,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:35,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:35,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 11:31:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:31:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936982886] [2024-09-25 11:31:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936982886] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:31:35,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:31:35,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 11:31:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342035490] [2024-09-25 11:31:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:31:35,734 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 11:31:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:31:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 11:31:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:31:35,739 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 11:31:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:31:35,871 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-09-25 11:31:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 11:31:35,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-09-25 11:31:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:31:35,873 INFO L225 Difference]: With dead ends: 46 [2024-09-25 11:31:35,876 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 11:31:35,877 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-25 11:31:35,878 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:31:35,878 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:31:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 11:31:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-25 11:31:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-25 11:31:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-25 11:31:35,891 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 25 [2024-09-25 11:31:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:31:35,892 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-25 11:31:35,892 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 11:31:35,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-25 11:31:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 11:31:35,894 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:35,894 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:35,894 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:31:35,895 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:35,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:35,895 INFO L85 PathProgramCache]: Analyzing trace with hash 889705653, now seen corresponding path program 1 times [2024-09-25 11:31:35,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:35,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062418447] [2024-09-25 11:31:35,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:35,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:36,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:36,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:36,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:36,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:36,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 11:31:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 11:31:36,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:36,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062418447] [2024-09-25 11:31:36,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062418447] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:36,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793142514] [2024-09-25 11:31:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:36,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:36,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:31:36,516 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:31:36,517 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:31:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:36,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-25 11:31:36,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:31:36,669 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-09-25 11:31:36,872 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 13 [2024-09-25 11:31:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 11:31:36,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:31:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:31:37,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793142514] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:31:37,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:31:37,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-09-25 11:31:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18055019] [2024-09-25 11:31:37,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:31:37,406 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-25 11:31:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:31:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-25 11:31:37,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:31:37,408 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-25 11:31:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:31:37,651 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-09-25 11:31:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 11:31:37,652 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) Word has length 30 [2024-09-25 11:31:37,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:31:37,653 INFO L225 Difference]: With dead ends: 50 [2024-09-25 11:31:37,653 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 11:31:37,654 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2024-09-25 11:31:37,655 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:31:37,655 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 109 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:31:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 11:31:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-25 11:31:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-25 11:31:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-09-25 11:31:37,666 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 30 [2024-09-25 11:31:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:31:37,667 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-09-25 11:31:37,667 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 8 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-25 11:31:37,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-09-25 11:31:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-25 11:31:37,668 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:37,669 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:37,687 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 11:31:37,873 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:31:37,874 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:37,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1706437626, now seen corresponding path program 2 times [2024-09-25 11:31:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635764288] [2024-09-25 11:31:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:38,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:38,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:38,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:38,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:38,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:38,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 11:31:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 11:31:38,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:38,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635764288] [2024-09-25 11:31:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635764288] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487518728] [2024-09-25 11:31:38,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:31:38,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:38,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:31:38,517 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:31:38,520 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:31:38,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:31:38,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:31:38,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 11:31:38,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:31:38,614 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-09-25 11:31:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-25 11:31:38,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:31:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-25 11:31:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487518728] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:31:39,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:31:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-09-25 11:31:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332738328] [2024-09-25 11:31:39,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:31:39,247 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 11:31:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:31:39,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 11:31:39,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2024-09-25 11:31:39,249 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-25 11:31:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:31:39,618 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-09-25 11:31:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 11:31:39,618 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 35 [2024-09-25 11:31:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:31:39,622 INFO L225 Difference]: With dead ends: 56 [2024-09-25 11:31:39,622 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 11:31:39,623 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2024-09-25 11:31:39,624 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:31:39,624 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 87 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:31:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 11:31:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-25 11:31:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-25 11:31:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-25 11:31:39,638 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2024-09-25 11:31:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:31:39,639 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-25 11:31:39,639 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 10 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-25 11:31:39,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-25 11:31:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-09-25 11:31:39,642 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:39,643 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:39,660 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:31:39,843 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:31:39,844 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:39,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1700016267, now seen corresponding path program 3 times [2024-09-25 11:31:39,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:39,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774663171] [2024-09-25 11:31:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:39,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:31:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:31:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-09-25 11:31:40,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774663171] [2024-09-25 11:31:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774663171] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632427418] [2024-09-25 11:31:40,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:31:40,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:40,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:31:40,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:31:40,903 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 11:31:40,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 11:31:40,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:31:40,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-25 11:31:40,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:31:41,005 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-09-25 11:31:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-09-25 11:31:41,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:31:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-09-25 11:31:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632427418] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:31:42,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:31:42,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 34 [2024-09-25 11:31:42,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840272726] [2024-09-25 11:31:42,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:31:42,073 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-25 11:31:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:31:42,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-25 11:31:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2024-09-25 11:31:42,075 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2024-09-25 11:31:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:31:42,537 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2024-09-25 11:31:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 11:31:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) Word has length 66 [2024-09-25 11:31:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:31:42,539 INFO L225 Difference]: With dead ends: 64 [2024-09-25 11:31:42,539 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 11:31:42,540 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=1694, Unknown=0, NotChecked=0, Total=1980 [2024-09-25 11:31:42,540 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:31:42,541 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 148 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:31:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 11:31:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-25 11:31:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 10 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-25 11:31:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-09-25 11:31:42,550 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 66 [2024-09-25 11:31:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:31:42,550 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-09-25 11:31:42,551 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 28 states have internal predecessors, (50), 13 states have call successors, (19), 7 states have call predecessors, (19), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2024-09-25 11:31:42,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-09-25 11:31:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-09-25 11:31:42,553 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:42,554 INFO L216 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:42,571 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 11:31:42,757 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:42,758 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:42,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -515831498, now seen corresponding path program 4 times [2024-09-25 11:31:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767460946] [2024-09-25 11:31:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:43,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:43,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:43,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:43,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:31:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:31:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:31:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 12 proven. 212 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-09-25 11:31:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767460946] [2024-09-25 11:31:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767460946] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187416971] [2024-09-25 11:31:44,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 11:31:44,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:31:44,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:31:44,414 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:31:44,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 11:31:44,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:31:44,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-09-25 11:31:44,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:31:44,570 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-09-25 11:31:44,776 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 13 [2024-09-25 11:31:44,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-25 11:31:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-09-25 11:31:44,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:31:45,242 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 7 treesize of output 3 [2024-09-25 11:31:45,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187416971] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:45,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:31:45,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-09-25 11:31:45,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898607564] [2024-09-25 11:31:45,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:31:45,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 11:31:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:31:45,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 11:31:45,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2024-09-25 11:31:45,475 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-25 11:31:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:31:45,904 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-09-25 11:31:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 11:31:45,905 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) Word has length 107 [2024-09-25 11:31:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:31:45,906 INFO L225 Difference]: With dead ends: 75 [2024-09-25 11:31:45,906 INFO L226 Difference]: Without dead ends: 44 [2024-09-25 11:31:45,908 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2024-09-25 11:31:45,909 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:31:45,909 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:31:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-25 11:31:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-09-25 11:31:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 12 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-25 11:31:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-09-25 11:31:45,925 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 107 [2024-09-25 11:31:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:31:45,926 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-09-25 11:31:45,926 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-25 11:31:45,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-09-25 11:31:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-09-25 11:31:45,931 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:45,931 INFO L216 NwaCegarLoop]: trace histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:45,948 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 11:31:46,131 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:46,132 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:46,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash -313299501, now seen corresponding path program 1 times [2024-09-25 11:31:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122851243] [2024-09-25 11:31:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:46,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:46,877 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:47,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:47,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:47,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:47,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:31:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,182 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:31:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:31:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-09-25 11:31:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:48,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122851243] [2024-09-25 11:31:48,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122851243] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:48,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956170249] [2024-09-25 11:31:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:48,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:31:48,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:31:48,234 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:31:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:48,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-25 11:31:48,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:31:48,402 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-09-25 11:31:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-09-25 11:31:48,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:31:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2024-09-25 11:31:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956170249] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:31:49,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:31:49,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 18] total 41 [2024-09-25 11:31:49,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150797233] [2024-09-25 11:31:49,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:31:49,913 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-25 11:31:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:31:49,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-25 11:31:49,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 11:31:49,915 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) [2024-09-25 11:31:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:31:50,400 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2024-09-25 11:31:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-25 11:31:50,402 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) Word has length 122 [2024-09-25 11:31:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:31:50,403 INFO L225 Difference]: With dead ends: 80 [2024-09-25 11:31:50,403 INFO L226 Difference]: Without dead ends: 43 [2024-09-25 11:31:50,404 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=2456, Unknown=0, NotChecked=0, Total=2862 [2024-09-25 11:31:50,404 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:31:50,405 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 178 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:31:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-25 11:31:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-25 11:31:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-25 11:31:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-25 11:31:50,418 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 122 [2024-09-25 11:31:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:31:50,418 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-25 11:31:50,418 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.78125) internal successors, (57), 34 states have internal predecessors, (57), 15 states have call successors, (21), 8 states have call predecessors, (21), 16 states have return successors, (24), 17 states have call predecessors, (24), 15 states have call successors, (24) [2024-09-25 11:31:50,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-25 11:31:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-09-25 11:31:50,420 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:50,420 INFO L216 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:50,434 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 11:31:50,621 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 11:31:50,621 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:50,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash -525253801, now seen corresponding path program 5 times [2024-09-25 11:31:50,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:50,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300649379] [2024-09-25 11:31:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:51,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:51,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:31:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:52,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:31:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,093 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,100 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:31:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:31:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2024-09-25 11:31:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300649379] [2024-09-25 11:31:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300649379] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51097573] [2024-09-25 11:31:53,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 11:31:53,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:53,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:31:53,337 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:31:53,338 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 11:31:54,061 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-09-25 11:31:54,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:31:54,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-25 11:31:54,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:31:54,079 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-09-25 11:31:54,300 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 13 [2024-09-25 11:31:54,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-25 11:31:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2024-09-25 11:31:54,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:31:54,824 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 7 treesize of output 3 [2024-09-25 11:31:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51097573] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:55,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:31:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2024-09-25 11:31:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990447832] [2024-09-25 11:31:55,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:31:55,018 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 11:31:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:31:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 11:31:55,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-09-25 11:31:55,019 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-25 11:31:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:31:55,293 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-09-25 11:31:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 11:31:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) Word has length 178 [2024-09-25 11:31:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:31:55,295 INFO L225 Difference]: With dead ends: 58 [2024-09-25 11:31:55,295 INFO L226 Difference]: Without dead ends: 55 [2024-09-25 11:31:55,295 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2024-09-25 11:31:55,296 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:31:55,296 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:31:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-25 11:31:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-09-25 11:31:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (19), 16 states have call predecessors, (19), 5 states have call successors, (19) [2024-09-25 11:31:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-09-25 11:31:55,315 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 178 [2024-09-25 11:31:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:31:55,318 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-09-25 11:31:55,318 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.8) internal successors, (36), 22 states have internal predecessors, (36), 10 states have call successors, (14), 4 states have call predecessors, (14), 10 states have return successors, (14), 13 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-25 11:31:55,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-09-25 11:31:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-09-25 11:31:55,322 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:31:55,322 INFO L216 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:31:55,343 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 11:31:55,522 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:55,523 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:31:55,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:31:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash -525251879, now seen corresponding path program 2 times [2024-09-25 11:31:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:31:55,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071610177] [2024-09-25 11:31:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:31:55,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:31:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:56,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:31:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:56,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:31:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:31:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:31:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:57,969 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:31:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:31:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:31:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:31:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 1810 trivial. 0 not checked. [2024-09-25 11:31:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:31:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071610177] [2024-09-25 11:31:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071610177] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:31:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658589358] [2024-09-25 11:31:58,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:31:58,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:31:58,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:31:58,155 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:31:58,157 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 11:31:58,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:31:58,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:31:58,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-25 11:31:58,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:31:58,410 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-09-25 11:31:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2024-09-25 11:31:58,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:32:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2024-09-25 11:32:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658589358] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:32:00,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:32:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 42 [2024-09-25 11:32:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390112291] [2024-09-25 11:32:00,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:32:00,153 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-25 11:32:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:32:00,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-25 11:32:00,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2024-09-25 11:32:00,154 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2024-09-25 11:32:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:32:00,552 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-09-25 11:32:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 11:32:00,552 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) Word has length 178 [2024-09-25 11:32:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:32:00,553 INFO L225 Difference]: With dead ends: 52 [2024-09-25 11:32:00,554 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 11:32:00,554 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 395 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=444, Invalid=2006, Unknown=0, NotChecked=0, Total=2450 [2024-09-25 11:32:00,555 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:32:00,559 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 178 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:32:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 11:32:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-25 11:32:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (17), 15 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-25 11:32:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-09-25 11:32:00,570 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 178 [2024-09-25 11:32:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:32:00,570 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-09-25 11:32:00,570 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 17 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2024-09-25 11:32:00,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:32:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-09-25 11:32:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-09-25 11:32:00,576 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:32:00,576 INFO L216 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:32:00,596 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 11:32:00,777 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:32:00,777 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:32:00,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:32:00,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1830036763, now seen corresponding path program 6 times [2024-09-25 11:32:00,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:32:00,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483499414] [2024-09-25 11:32:00,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:32:00,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:32:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:01,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:32:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:01,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:32:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:02,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:02,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:02,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:02,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:02,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:02,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:02,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:02,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:03,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 937 proven. 34 refuted. 0 times theorem prover too weak. 3232 trivial. 0 not checked. [2024-09-25 11:32:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:32:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483499414] [2024-09-25 11:32:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483499414] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:32:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032690605] [2024-09-25 11:32:04,848 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 11:32:04,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:32:04,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:32:04,850 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:32:04,851 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 11:32:11,831 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2024-09-25 11:32:11,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:32:11,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-09-25 11:32:11,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:32:11,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-25 11:32:12,204 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:32:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1171 proven. 81 refuted. 0 times theorem prover too weak. 2951 trivial. 0 not checked. [2024-09-25 11:32:12,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:32:13,172 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 25 treesize of output 21 [2024-09-25 11:32:13,702 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 25 treesize of output 21 [2024-09-25 11:32:14,047 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 25 treesize of output 21 [2024-09-25 11:32:14,342 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 25 treesize of output 21 [2024-09-25 11:32:14,607 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 25 treesize of output 21 [2024-09-25 11:32:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032690605] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:32:15,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:32:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 25 [2024-09-25 11:32:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134603207] [2024-09-25 11:32:15,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:32:15,181 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 11:32:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:32:15,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 11:32:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2024-09-25 11:32:15,182 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-25 11:32:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:32:15,655 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-09-25 11:32:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 11:32:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 260 [2024-09-25 11:32:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:32:15,657 INFO L225 Difference]: With dead ends: 52 [2024-09-25 11:32:15,657 INFO L226 Difference]: Without dead ends: 49 [2024-09-25 11:32:15,658 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2024-09-25 11:32:15,658 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:32:15,658 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 226 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:32:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-25 11:32:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-09-25 11:32:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (17), 15 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-25 11:32:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-09-25 11:32:15,671 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 260 [2024-09-25 11:32:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:32:15,672 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-09-25 11:32:15,673 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 9 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-25 11:32:15,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:32:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-09-25 11:32:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-09-25 11:32:15,675 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:32:15,676 INFO L216 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:32:15,705 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-25 11:32:15,876 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:32:15,877 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:32:15,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:32:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1830038685, now seen corresponding path program 3 times [2024-09-25 11:32:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:32:15,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679173550] [2024-09-25 11:32:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:32:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:32:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:16,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:32:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:16,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:32:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:17,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,577 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:32:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 11:32:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:32:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 4165 trivial. 0 not checked. [2024-09-25 11:32:18,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:32:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679173550] [2024-09-25 11:32:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679173550] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:32:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752521602] [2024-09-25 11:32:18,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:32:18,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:32:18,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:32:18,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:32:18,836 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 11:32:21,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2024-09-25 11:32:21,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:32:21,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-09-25 11:32:21,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:32:21,812 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 13 [2024-09-25 11:32:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1186 proven. 18 refuted. 0 times theorem prover too weak. 2999 trivial. 0 not checked. [2024-09-25 11:32:21,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:32:22,767 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 11:32:22,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 11:32:23,114 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 11:32:23,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 11:32:23,363 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 11:32:23,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 11:32:23,545 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 11:32:23,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 11:32:23,708 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-25 11:32:23,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-09-25 11:32:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 4159 trivial. 0 not checked. [2024-09-25 11:32:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752521602] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:32:32,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:32:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 26 [2024-09-25 11:32:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353215058] [2024-09-25 11:32:32,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:32:32,468 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 11:32:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:32:32,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 11:32:32,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=565, Unknown=2, NotChecked=0, Total=650 [2024-09-25 11:32:32,469 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-25 11:32:36,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:32:36,855 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-09-25 11:32:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 11:32:36,855 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 260 [2024-09-25 11:32:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:32:36,856 INFO L225 Difference]: With dead ends: 51 [2024-09-25 11:32:36,856 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:32:36,857 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 607 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=176, Invalid=1012, Unknown=2, NotChecked=0, Total=1190 [2024-09-25 11:32:36,858 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:32:36,858 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 60 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 327 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2024-09-25 11:32:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:32:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:32:36,858 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:32:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:32:36,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2024-09-25 11:32:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:32:36,859 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:32:36,859 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-25 11:32:36,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:32:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:32:36,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:32:36,862 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:32:36,886 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 11:32:37,062 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 11:32:37,065 INFO L408 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1] [2024-09-25 11:32:37,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:32:38,444 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:32:38,450 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: (= (select (select |#memory_int#2| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) [2024-09-25 11:32:38,457 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,457 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 11:32:38,458 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-25 11:32:38,460 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:32:38,461 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:32:38,461 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:32:38,461 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:32:38,461 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:32:38,461 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-25 11:32:38,461 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-25 11:32:38,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 11:32:38,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-25 11:32:38,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:32:38,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:32:38,463 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:32:38,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-25 11:32:38,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-25 11:32:38,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:32:38,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:32:38,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,465 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-25 11:32:38,465 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-25 11:32:38,465 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:32:38,465 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:32:38,465 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: true [2024-09-25 11:32:38,467 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:32:38,467 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:32:38,467 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:32:38,467 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:32:38,468 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67| Int)) (<= (select (select |#memory_int#1| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67|) 5))) Eliminated clause: (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67| Int)) (<= (select (select |#memory_int#1| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_67|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_67|) 5)) [2024-09-25 11:32:38,470 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 11:32:38,471 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:32:38,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:32:38,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:32:38,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:32:38,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:32:38,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:32:38,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:32:38,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:32:38,477 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:32:38,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:32:38 BoogieIcfgContainer [2024-09-25 11:32:38,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:32:38,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:32:38,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:32:38,477 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:32:38,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:31:34" (3/4) ... [2024-09-25 11:32:38,483 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:32:38,528 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:32:38,528 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:32:38,529 INFO L158 Benchmark]: Toolchain (without parser) took 64885.82ms. Allocated memory was 58.7MB in the beginning and 1.0GB in the end (delta: 964.7MB). Free memory was 35.5MB in the beginning and 424.0MB in the end (delta: -388.5MB). Peak memory consumption was 576.2MB. Max. memory is 16.1GB. [2024-09-25 11:32:38,529 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 44.0MB. Free memory was 27.5MB in the beginning and 27.5MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:32:38,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.26ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 35.3MB in the beginning and 54.6MB in the end (delta: -19.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-09-25 11:32:38,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.84ms. Allocated memory is still 75.5MB. Free memory was 54.6MB in the beginning and 53.6MB in the end (delta: 987.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:32:38,530 INFO L158 Benchmark]: Boogie Preprocessor took 48.68ms. Allocated memory is still 75.5MB. Free memory was 53.6MB in the beginning and 51.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:32:38,530 INFO L158 Benchmark]: RCFGBuilder took 394.14ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 38.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 11:32:38,530 INFO L158 Benchmark]: TraceAbstraction took 64116.82ms. Allocated memory was 75.5MB in the beginning and 1.0GB in the end (delta: 947.9MB). Free memory was 37.7MB in the beginning and 426.1MB in the end (delta: -388.4MB). Peak memory consumption was 560.6MB. Max. memory is 16.1GB. [2024-09-25 11:32:38,531 INFO L158 Benchmark]: Witness Printer took 51.10ms. Allocated memory is still 1.0GB. Free memory was 426.1MB in the beginning and 424.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:32:38,532 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 44.0MB. Free memory was 27.5MB in the beginning and 27.5MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.26ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 35.3MB in the beginning and 54.6MB in the end (delta: -19.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.84ms. Allocated memory is still 75.5MB. Free memory was 54.6MB in the beginning and 53.6MB in the end (delta: 987.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.68ms. Allocated memory is still 75.5MB. Free memory was 53.6MB in the beginning and 51.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.14ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 38.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 64116.82ms. Allocated memory was 75.5MB in the beginning and 1.0GB in the end (delta: 947.9MB). Free memory was 37.7MB in the beginning and 426.1MB in the end (delta: -388.4MB). Peak memory consumption was 560.6MB. Max. memory is 16.1GB. * Witness Printer took 51.10ms. Allocated memory is still 1.0GB. Free memory was 426.1MB in the beginning and 424.0MB in the end (delta: 2.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: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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#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~a!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~b!base,]]] - 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: #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~a!base,]]] - 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: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - 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: 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#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 69]: 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.6s, OverallIterations: 11, TraceHistogramMax: 42, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 1292 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1121 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3090 IncrementalHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 171 mSDtfsCounter, 3090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2671 GetRequests, 2301 SyntacticMatches, 7 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3851 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=8, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 10.4s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 2511 NumberOfCodeBlocks, 2458 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 3176 ConstructedInterpolants, 38 QuantifiedInterpolants, 10781 SizeOfPredicates, 107 NumberOfNonLiveVariables, 5010 ConjunctsInSsa, 525 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 32994/34038 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 RESULT: Ultimate proved your program to be correct! [2024-09-25 11:32:38,576 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE