./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/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 de325976 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/loop-simple/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 5dbc8f54f9c446babb02937902a9e0651922ee3ad3469ce820281714b321626f --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-de32597-m [2024-09-17 18:29:32,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:29:32,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 18:29:32,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:29:32,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:29:32,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:29:32,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:29:32,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:29:32,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:29:32,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:29:32,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:29:32,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:29:32,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:29:32,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:29:32,970 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:29:32,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:29:32,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:29:32,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:29:32,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 18:29:32,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:29:32,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:29:32,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:29:32,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:29:32,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:29:32,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:29:32,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:29:32,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:29:32,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:29:32,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:29:32,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:29:32,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:29:32,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:29:32,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:29:32,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:29:32,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:29:32,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:29:32,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 18:29:32,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 18:29:32,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:29:32,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:29:32,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:29:32,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:29:32,981 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 -> 5dbc8f54f9c446babb02937902a9e0651922ee3ad3469ce820281714b321626f 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-17 18:29:33,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:29:33,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:29:33,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:29:33,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:29:33,183 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:29:33,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_1.c [2024-09-17 18:29:34,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:29:34,563 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:29:34,564 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_1.c [2024-09-17 18:29:34,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/43b2b6ad3/d6cfd7dd755b44f884928c20f2582173/FLAGcc4d5d19d [2024-09-17 18:29:34,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/43b2b6ad3/d6cfd7dd755b44f884928c20f2582173 [2024-09-17 18:29:34,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:29:34,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:29:34,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:29:34,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:29:34,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:29:34,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66967d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34, skipping insertion in model container [2024-09-17 18:29:34,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:29:34,722 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/loop-simple/nested_1.c[676,689] [2024-09-17 18:29:34,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:29:34,739 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:29:34,750 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/loop-simple/nested_1.c[676,689] [2024-09-17 18:29:34,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:29:34,764 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:29:34,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34 WrapperNode [2024-09-17 18:29:34,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:29:34,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:29:34,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:29:34,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:29:34,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,780 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:29:34,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:29:34,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:29:34,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:29:34,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:29:34,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,796 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-17 18:29:34,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:29:34,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:29:34,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:29:34,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:29:34,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (1/1) ... [2024-09-17 18:29:34,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:29:34,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:29:34,833 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-17 18:29:34,845 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-17 18:29:34,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:29:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:29:34,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:29:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:29:34,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:29:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:29:34,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:29:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 18:29:34,947 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:29:34,949 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:29:35,043 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-17 18:29:35,043 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:29:35,065 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:29:35,066 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-17 18:29:35,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:29:35 BoogieIcfgContainer [2024-09-17 18:29:35,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:29:35,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:29:35,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:29:35,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:29:35,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:29:34" (1/3) ... [2024-09-17 18:29:35,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24086198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:29:35, skipping insertion in model container [2024-09-17 18:29:35,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:29:34" (2/3) ... [2024-09-17 18:29:35,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24086198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:29:35, skipping insertion in model container [2024-09-17 18:29:35,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:29:35" (3/3) ... [2024-09-17 18:29:35,075 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_1.c [2024-09-17 18:29:35,088 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:29:35,089 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 18:29:35,131 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:29:35,136 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;@374c1d34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:29:35,137 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 18:29:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-17 18:29:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-17 18:29:35,145 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:29:35,145 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:29:35,146 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:29:35,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:29:35,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1599925043, now seen corresponding path program 1 times [2024-09-17 18:29:35,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:29:35,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263225] [2024-09-17 18:29:35,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:29:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:29:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:29:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,263 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-17 18:29:35,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:29:35,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263225] [2024-09-17 18:29:35,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263225] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:29:35,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:29:35,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-17 18:29:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248503867] [2024-09-17 18:29:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:29:35,270 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-17 18:29:35,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:29:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-17 18:29:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-17 18:29:35,287 INFO L87 Difference]: Start difference. First operand has 13 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:29:35,304 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-09-17 18:29:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-17 18:29:35,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-17 18:29:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:29:35,311 INFO L225 Difference]: With dead ends: 20 [2024-09-17 18:29:35,311 INFO L226 Difference]: Without dead ends: 9 [2024-09-17 18:29:35,314 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-17 18:29:35,318 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 18:29:35,319 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:29:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-09-17 18:29:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-09-17 18:29:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-09-17 18:29:35,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2024-09-17 18:29:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:29:35,343 INFO L474 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-09-17 18:29:35,343 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:29:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-09-17 18:29:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-17 18:29:35,345 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:29:35,345 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:29:35,345 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 18:29:35,346 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:29:35,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:29:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1599919277, now seen corresponding path program 1 times [2024-09-17 18:29:35,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:29:35,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004812383] [2024-09-17 18:29:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:29:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:29:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:29:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,456 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-17 18:29:35,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:29:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004812383] [2024-09-17 18:29:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004812383] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:29:35,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:29:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-17 18:29:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030463917] [2024-09-17 18:29:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:29:35,459 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-17 18:29:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:29:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-17 18:29:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 18:29:35,461 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:29:35,475 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-09-17 18:29:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-17 18:29:35,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-17 18:29:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:29:35,477 INFO L225 Difference]: With dead ends: 13 [2024-09-17 18:29:35,477 INFO L226 Difference]: Without dead ends: 10 [2024-09-17 18:29:35,477 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 18:29:35,478 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 18:29:35,480 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:29:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-09-17 18:29:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-09-17 18:29:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-09-17 18:29:35,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2024-09-17 18:29:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:29:35,485 INFO L474 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-09-17 18:29:35,485 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:29:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-09-17 18:29:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-17 18:29:35,486 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:29:35,486 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:29:35,486 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 18:29:35,486 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:29:35,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:29:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1941434391, now seen corresponding path program 1 times [2024-09-17 18:29:35,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:29:35,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218951118] [2024-09-17 18:29:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:29:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:29:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:29:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:29:35,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:29:35,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218951118] [2024-09-17 18:29:35,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218951118] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:29:35,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641177115] [2024-09-17 18:29:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:29:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:29:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:29:35,548 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-17 18:29:35,549 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-17 18:29:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-17 18:29:35,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:29:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:29:35,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:29:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:29:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641177115] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:29:35,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 18:29:35,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-17 18:29:35,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842367981] [2024-09-17 18:29:35,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 18:29:35,666 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:29:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:29:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:29:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:29:35,668 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:29:35,692 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-09-17 18:29:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:29:35,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-09-17 18:29:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:29:35,693 INFO L225 Difference]: With dead ends: 16 [2024-09-17 18:29:35,693 INFO L226 Difference]: Without dead ends: 13 [2024-09-17 18:29:35,694 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:29:35,695 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 18:29:35,697 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:29:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-17 18:29:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-17 18:29:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-09-17 18:29:35,701 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-09-17 18:29:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:29:35,702 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-09-17 18:29:35,702 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:29:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-09-17 18:29:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-17 18:29:35,703 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:29:35,703 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:29:35,716 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-17 18:29:35,907 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-17 18:29:35,908 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:29:35,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:29:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash -571489363, now seen corresponding path program 2 times [2024-09-17 18:29:35,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:29:35,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913082792] [2024-09-17 18:29:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:29:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:29:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:29:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:29:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-17 18:29:35,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:29:35,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913082792] [2024-09-17 18:29:35,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913082792] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:29:35,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:29:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 18:29:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868988230] [2024-09-17 18:29:35,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:29:35,963 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 18:29:35,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:29:35,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 18:29:35,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-17 18:29:35,964 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:29:35,974 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-09-17 18:29:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 18:29:35,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-17 18:29:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:29:35,975 INFO L225 Difference]: With dead ends: 13 [2024-09-17 18:29:35,975 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 18:29:35,976 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-17 18:29:35,977 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 18:29:35,977 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:29:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 18:29:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 18:29:35,979 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-17 18:29:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 18:29:35,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-09-17 18:29:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:29:35,980 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 18:29:35,980 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:29:35,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:29:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 18:29:35,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 18:29:35,983 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-17 18:29:35,983 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-17 18:29:35,989 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-09-17 18:29:35,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-17 18:29:36,015 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 18:29:36,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.09 06:29:36 BoogieIcfgContainer [2024-09-17 18:29:36,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-17 18:29:36,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-17 18:29:36,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-17 18:29:36,027 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-17 18:29:36,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:29:35" (3/4) ... [2024-09-17 18:29:36,029 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-17 18:29:36,066 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-17 18:29:36,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-17 18:29:36,067 INFO L158 Benchmark]: Toolchain (without parser) took 1485.72ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 86.4MB in the beginning and 152.1MB in the end (delta: -65.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:29:36,068 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:29:36,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.39ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 75.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-17 18:29:36,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.59ms. Allocated memory is still 159.4MB. Free memory was 75.4MB in the beginning and 74.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:29:36,070 INFO L158 Benchmark]: Boogie Preprocessor took 24.82ms. Allocated memory is still 159.4MB. Free memory was 74.3MB in the beginning and 72.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:29:36,070 INFO L158 Benchmark]: RCFGBuilder took 260.27ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 72.7MB in the beginning and 176.9MB in the end (delta: -104.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-17 18:29:36,070 INFO L158 Benchmark]: TraceAbstraction took 957.72ms. Allocated memory is still 211.8MB. Free memory was 175.8MB in the beginning and 155.3MB in the end (delta: 20.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-09-17 18:29:36,070 INFO L158 Benchmark]: Witness Printer took 40.23ms. Allocated memory is still 211.8MB. Free memory was 155.3MB in the beginning and 152.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:29:36,072 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.15ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.39ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 75.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.59ms. Allocated memory is still 159.4MB. Free memory was 75.4MB in the beginning and 74.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.82ms. Allocated memory is still 159.4MB. Free memory was 74.3MB in the beginning and 72.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 260.27ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 72.7MB in the beginning and 176.9MB in the end (delta: -104.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 957.72ms. Allocated memory is still 211.8MB. Free memory was 175.8MB in the beginning and 155.3MB in the end (delta: 20.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 40.23ms. Allocated memory is still 211.8MB. Free memory was 155.3MB in the beginning and 152.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 23]: 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 3 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 28 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 67 SizeOfPredicates, 0 NumberOfNonLiveVariables, 36 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 10/13 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 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (a < 7) RESULT: Ultimate proved your program to be correct! [2024-09-17 18:29:36,094 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