./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/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_1.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 34a8492e255374aad098e162859199083b5b90fe0eb733edf5e3563474d7ceaa --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:10:30,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:10:30,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:10:30,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:10:30,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:10:30,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:10:30,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:10:30,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:10:30,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:10:30,776 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:10:30,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:10:30,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:10:30,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:10:30,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:10:30,778 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:10:30,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:10:30,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:10:30,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:10:30,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:10:30,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:10:30,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:10:30,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:10:30,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:10:30,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:10:30,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:10:30,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:10:30,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:10:30,785 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:10:30,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:10:30,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:10:30,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:10:30,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:10:30,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:10:30,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:10:30,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:10:30,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:10:30,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:10:30,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:10:30,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:10:30,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:10:30,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:10:30,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:10:30,788 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 -> 34a8492e255374aad098e162859199083b5b90fe0eb733edf5e3563474d7ceaa 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 13:10:30,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:10:30,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:10:30,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:10:30,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:10:30,998 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:10:30,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1.c [2024-09-20 13:10:32,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:10:32,548 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:10:32,549 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1.c [2024-09-20 13:10:32,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a2fb2298d/a1b7409fc53a4ff386f2781efc947a3e/FLAG9387d5237 [2024-09-20 13:10:32,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a2fb2298d/a1b7409fc53a4ff386f2781efc947a3e [2024-09-20 13:10:32,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:10:32,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 13:10:32,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:10:32,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:10:32,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:10:32,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98dd9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32, skipping insertion in model container [2024-09-20 13:10:32,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:10:32,749 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_1.c[1277,1290] [2024-09-20 13:10:32,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:10:32,759 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 13:10:32,770 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_1.c[1277,1290] [2024-09-20 13:10:32,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:10:32,785 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:10:32,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32 WrapperNode [2024-09-20 13:10:32,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:10:32,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:10:32,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:10:32,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:10:32,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,805 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 13:10:32,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:10:32,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:10:32,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:10:32,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:10:32,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,826 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2024-09-20 13:10:32,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:10:32,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:10:32,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:10:32,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:10:32,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (1/1) ... [2024-09-20 13:10:32,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:10:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:10:32,868 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-20 13:10:32,876 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-20 13:10:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-20 13:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-20 13:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 13:10:32,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 13:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_19_to_19_0 [2024-09-20 13:10:32,910 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_19_to_19_0 [2024-09-20 13:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:10:32,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 13:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 13:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 13:10:32,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 13:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 13:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 13:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-20 13:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 13:10:32,965 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:10:32,966 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:10:33,055 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2024-09-20 13:10:33,055 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:10:33,071 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:10:33,071 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 13:10:33,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:10:33 BoogieIcfgContainer [2024-09-20 13:10:33,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:10:33,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:10:33,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:10:33,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:10:33,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:10:32" (1/3) ... [2024-09-20 13:10:33,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a1b634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:10:33, skipping insertion in model container [2024-09-20 13:10:33,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:10:32" (2/3) ... [2024-09-20 13:10:33,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a1b634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:10:33, skipping insertion in model container [2024-09-20 13:10:33,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:10:33" (3/3) ... [2024-09-20 13:10:33,078 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_1.c [2024-09-20 13:10:33,091 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:10:33,091 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 13:10:33,133 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:10:33,138 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;@16d39d62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:10:33,138 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 13:10:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 13:10:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 13:10:33,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:10:33,147 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:10:33,147 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:10:33,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash 640195126, now seen corresponding path program 1 times [2024-09-20 13:10:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:10:33,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633240860] [2024-09-20 13:10:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:10:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:33,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:10:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:33,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:10:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:10:33,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:10:33,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633240860] [2024-09-20 13:10:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633240860] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:10:33,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:10:33,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 13:10:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061241828] [2024-09-20 13:10:33,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:10:33,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:10:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:10:33,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:10:33,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:10:33,498 INFO L87 Difference]: Start difference. First operand has 19 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-20 13:10:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:10:33,589 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-09-20 13:10:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 13:10:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 13 [2024-09-20 13:10:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:10:33,599 INFO L225 Difference]: With dead ends: 29 [2024-09-20 13:10:33,599 INFO L226 Difference]: Without dead ends: 17 [2024-09-20 13:10:33,601 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-20 13:10:33,605 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:10:33,607 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:10:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-20 13:10:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-20 13:10:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 13:10:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-20 13:10:33,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2024-09-20 13:10:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:10:33,639 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-20 13:10:33,639 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-20 13:10:33,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-20 13:10:33,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-20 13:10:33,641 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:10:33,641 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:10:33,642 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:10:33,642 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:10:33,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1526075367, now seen corresponding path program 1 times [2024-09-20 13:10:33,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:10:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063888844] [2024-09-20 13:10:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:10:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:33,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:10:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:33,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:10:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:33,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 13:10:34,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:10:34,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063888844] [2024-09-20 13:10:34,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063888844] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:10:34,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882086483] [2024-09-20 13:10:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:34,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:34,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:10:34,051 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-20 13:10:34,052 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-20 13:10:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:34,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-20 13:10:34,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:10:34,152 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-20 13:10:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 13:10:34,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:10:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:10:34,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882086483] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:10:34,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:10:34,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2024-09-20 13:10:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673520583] [2024-09-20 13:10:34,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:10:34,612 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-20 13:10:34,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:10:34,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-20 13:10:34,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-09-20 13:10:34,614 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 13:10:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:10:34,777 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-09-20 13:10:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 13:10:34,777 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Word has length 18 [2024-09-20 13:10:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:10:34,778 INFO L225 Difference]: With dead ends: 25 [2024-09-20 13:10:34,778 INFO L226 Difference]: Without dead ends: 21 [2024-09-20 13:10:34,779 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2024-09-20 13:10:34,780 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:10:34,780 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:10:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-20 13:10:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-20 13:10:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-20 13:10:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-20 13:10:34,787 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2024-09-20 13:10:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:10:34,787 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-20 13:10:34,787 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 13:10:34,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-20 13:10:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 13:10:34,789 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:10:34,789 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:10:34,802 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 13:10:34,989 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:34,990 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:10:34,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1370930293, now seen corresponding path program 2 times [2024-09-20 13:10:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:10:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142143969] [2024-09-20 13:10:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:10:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:35,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:10:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:35,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:10:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:35,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:35,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:35,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-20 13:10:35,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:10:35,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142143969] [2024-09-20 13:10:35,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142143969] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:10:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460492740] [2024-09-20 13:10:35,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 13:10:35,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:35,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:10:35,643 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-20 13:10:35,644 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-20 13:10:35,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 13:10:35,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 13:10:35,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-09-20 13:10:35,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:10:35,705 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-20 13:10:35,927 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-20 13:10:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:10:35,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:10:36,410 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 16 treesize of output 8 [2024-09-20 13:10:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460492740] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:10:48,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:10:48,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-09-20 13:10:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819223234] [2024-09-20 13:10:48,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:10:48,677 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-20 13:10:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:10:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-20 13:10:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=640, Unknown=3, NotChecked=0, Total=756 [2024-09-20 13:10:48,680 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-20 13:10:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:10:48,891 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-09-20 13:10:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 13:10:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 28 [2024-09-20 13:10:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:10:48,892 INFO L225 Difference]: With dead ends: 29 [2024-09-20 13:10:48,892 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 13:10:48,893 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=169, Invalid=950, Unknown=3, NotChecked=0, Total=1122 [2024-09-20 13:10:48,894 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:10:48,894 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:10:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 13:10:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-20 13:10:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-20 13:10:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-09-20 13:10:48,900 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 28 [2024-09-20 13:10:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:10:48,901 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-09-20 13:10:48,901 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-20 13:10:48,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-09-20 13:10:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-20 13:10:48,903 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:10:48,903 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:10:48,918 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 13:10:49,107 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:49,108 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:10:49,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash -812892675, now seen corresponding path program 3 times [2024-09-20 13:10:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:10:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563224848] [2024-09-20 13:10:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:10:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:49,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:10:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:49,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:10:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:49,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:49,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:49,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:49,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:50,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-20 13:10:50,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:10:50,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563224848] [2024-09-20 13:10:50,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563224848] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:10:50,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646054039] [2024-09-20 13:10:50,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 13:10:50,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:10:50,063 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-20 13:10:50,067 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-20 13:10:50,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-20 13:10:50,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 13:10:50,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-09-20 13:10:50,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:10:50,134 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-20 13:10:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-20 13:10:50,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:10:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:10:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646054039] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:10:51,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:10:51,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 44 [2024-09-20 13:10:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952486871] [2024-09-20 13:10:51,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:10:51,985 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-20 13:10:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:10:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-20 13:10:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1540, Unknown=0, NotChecked=0, Total=1892 [2024-09-20 13:10:51,987 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (13), 8 states have call predecessors, (13), 14 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2024-09-20 13:10:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:10:52,285 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-09-20 13:10:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-20 13:10:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (13), 8 states have call predecessors, (13), 14 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) Word has length 38 [2024-09-20 13:10:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:10:52,287 INFO L225 Difference]: With dead ends: 31 [2024-09-20 13:10:52,287 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 13:10:52,288 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=481, Invalid=2069, Unknown=0, NotChecked=0, Total=2550 [2024-09-20 13:10:52,289 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:10:52,290 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 135 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:10:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 13:10:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-20 13:10:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-20 13:10:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-20 13:10:52,295 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 38 [2024-09-20 13:10:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:10:52,295 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-20 13:10:52,296 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (13), 8 states have call predecessors, (13), 14 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2024-09-20 13:10:52,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-20 13:10:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-20 13:10:52,301 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:10:52,301 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:10:52,318 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 13:10:52,502 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:52,503 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:10:52,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash -715334516, now seen corresponding path program 4 times [2024-09-20 13:10:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:10:52,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864784047] [2024-09-20 13:10:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:52,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:10:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:52,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:10:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:52,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:10:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:52,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:52,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:52,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:52,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:52,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:52,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-09-20 13:10:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:10:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864784047] [2024-09-20 13:10:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864784047] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:10:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900813747] [2024-09-20 13:10:53,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 13:10:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:10:53,048 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-20 13:10:53,052 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-20 13:10:53,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 13:10:53,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 13:10:53,110 WARN L260 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-09-20 13:10:53,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:10:53,118 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-20 13:10:53,396 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-20 13:10:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 5 proven. 53 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-20 13:10:53,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:10:54,179 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 16 treesize of output 8 [2024-09-20 13:10:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900813747] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:10:54,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:10:54,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2024-09-20 13:10:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657656221] [2024-09-20 13:10:54,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:10:54,532 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-20 13:10:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:10:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-20 13:10:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2024-09-20 13:10:54,533 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 22 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-20 13:10:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:10:54,947 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-09-20 13:10:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-20 13:10:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-09-20 13:10:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:10:54,948 INFO L225 Difference]: With dead ends: 29 [2024-09-20 13:10:54,948 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 13:10:54,949 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2024-09-20 13:10:54,949 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:10:54,950 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:10:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 13:10:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 13:10:54,950 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-20 13:10:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 13:10:54,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2024-09-20 13:10:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:10:54,951 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 13:10:54,951 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-20 13:10:54,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 13:10:54,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 13:10:54,954 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 13:10:54,967 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 13:10:55,158 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:55,161 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1] [2024-09-20 13:10:55,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 13:10:55,484 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:10:55,505 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-20 13:10:55,506 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-20 13:10:55,506 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-20 13:10:55,506 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-20 13:10:55,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:10:55 BoogieIcfgContainer [2024-09-20 13:10:55,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 13:10:55,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 13:10:55,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 13:10:55,508 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 13:10:55,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:10:33" (3/4) ... [2024-09-20 13:10:55,509 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 13:10:55,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 13:10:55,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 13:10:55,546 INFO L158 Benchmark]: Toolchain (without parser) took 22972.21ms. Allocated memory was 169.9MB in the beginning and 224.4MB in the end (delta: 54.5MB). Free memory was 103.7MB in the beginning and 157.7MB in the end (delta: -54.0MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2024-09-20 13:10:55,546 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:10:55,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.54ms. Allocated memory is still 169.9MB. Free memory was 103.4MB in the beginning and 140.2MB in the end (delta: -36.8MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-09-20 13:10:55,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.95ms. Allocated memory is still 169.9MB. Free memory was 140.2MB in the beginning and 139.5MB in the end (delta: 715.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:10:55,548 INFO L158 Benchmark]: Boogie Preprocessor took 31.22ms. Allocated memory is still 169.9MB. Free memory was 138.8MB in the beginning and 137.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:10:55,548 INFO L158 Benchmark]: RCFGBuilder took 234.53ms. Allocated memory is still 169.9MB. Free memory was 137.5MB in the beginning and 125.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 13:10:55,548 INFO L158 Benchmark]: TraceAbstraction took 22433.69ms. Allocated memory was 169.9MB in the beginning and 224.4MB in the end (delta: 54.5MB). Free memory was 124.8MB in the beginning and 159.8MB in the end (delta: -35.1MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. [2024-09-20 13:10:55,549 INFO L158 Benchmark]: Witness Printer took 38.27ms. Allocated memory is still 224.4MB. Free memory was 159.8MB in the beginning and 157.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:10:55,550 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.14ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.54ms. Allocated memory is still 169.9MB. Free memory was 103.4MB in the beginning and 140.2MB in the end (delta: -36.8MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.95ms. Allocated memory is still 169.9MB. Free memory was 140.2MB in the beginning and 139.5MB in the end (delta: 715.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.22ms. Allocated memory is still 169.9MB. Free memory was 138.8MB in the beginning and 137.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.53ms. Allocated memory is still 169.9MB. Free memory was 137.5MB in the beginning and 125.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22433.69ms. Allocated memory was 169.9MB in the beginning and 224.4MB in the end (delta: 54.5MB). Free memory was 124.8MB in the beginning and 159.8MB in the end (delta: -35.1MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. * Witness Printer took 38.27ms. Allocated memory is still 224.4MB. Free memory was 159.8MB in the beginning and 157.7MB 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: 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: 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,]]] * 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: 48]: 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 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 370 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 807 IncrementalHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 64 mSDtfsCounter, 807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 172 SyntacticMatches, 6 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 267 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 2958 SizeOfPredicates, 44 NumberOfNonLiveVariables, 542 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 235/474 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-20 13:10:55,574 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE