./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/sum01-2.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 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/loops/sum01-2.i -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 5a3f2d13c78d25176694a62cbb92a7cb676735e2350dda904e35c5c69ea362e5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:20:07,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:20:07,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:20:07,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:20:07,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:20:07,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:20:07,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:20:07,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:20:07,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:20:07,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:20:07,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:20:07,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:20:07,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:20:07,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:20:07,283 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:20:07,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:20:07,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:20:07,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:20:07,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:20:07,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:20:07,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:20:07,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:20:07,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:20:07,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:20:07,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:20:07,289 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:20:07,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:20:07,290 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:20:07,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:20:07,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:20:07,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:20:07,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:20:07,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:20:07,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:20:07,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:20:07,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:20:07,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:20:07,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:20:07,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:20:07,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:20:07,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:20:07,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:20:07,295 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 -> 5a3f2d13c78d25176694a62cbb92a7cb676735e2350dda904e35c5c69ea362e5 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 [2024-09-12 15:20:07,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:20:07,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:20:07,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:20:07,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:20:07,648 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:20:07,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/sum01-2.i [2024-09-12 15:20:09,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:20:09,362 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:20:09,363 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/sum01-2.i [2024-09-12 15:20:09,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ea5717434/915cb0aac4434661b207b37363839cbb/FLAG1f8624596 [2024-09-12 15:20:09,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ea5717434/915cb0aac4434661b207b37363839cbb [2024-09-12 15:20:09,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:20:09,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:20:09,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:20:09,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:20:09,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:20:09,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac31885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09, skipping insertion in model container [2024-09-12 15:20:09,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:20:09,590 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/sum01-2.i[849,862] [2024-09-12 15:20:09,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:20:09,621 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:20:09,633 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/sum01-2.i[849,862] [2024-09-12 15:20:09,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:20:09,661 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:20:09,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09 WrapperNode [2024-09-12 15:20:09,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:20:09,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:20:09,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:20:09,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:20:09,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,685 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:20:09,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:20:09,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:20:09,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:20:09,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:20:09,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,715 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-12 15:20:09,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:20:09,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:20:09,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:20:09,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:20:09,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (1/1) ... [2024-09-12 15:20:09,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:20:09,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:20:09,764 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-12 15:20:09,770 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-12 15:20:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:20:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:20:09,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:20:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:20:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:20:09,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:20:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:20:09,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:20:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:20:09,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:20:09,886 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:20:09,889 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:20:10,014 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 15:20:10,014 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:20:10,045 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:20:10,045 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 15:20:10,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:20:10 BoogieIcfgContainer [2024-09-12 15:20:10,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:20:10,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:20:10,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:20:10,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:20:10,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:20:09" (1/3) ... [2024-09-12 15:20:10,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d655071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:20:10, skipping insertion in model container [2024-09-12 15:20:10,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:09" (2/3) ... [2024-09-12 15:20:10,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d655071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:20:10, skipping insertion in model container [2024-09-12 15:20:10,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:20:10" (3/3) ... [2024-09-12 15:20:10,064 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2024-09-12 15:20:10,083 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:20:10,084 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:20:10,147 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:20:10,155 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;@5443bbc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:20:10,156 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:20:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 15:20:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:20:10,168 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:10,169 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:10,170 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:10,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash -28487812, now seen corresponding path program 1 times [2024-09-12 15:20:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:10,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779276725] [2024-09-12 15:20:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:10,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:10,350 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-12 15:20:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779276725] [2024-09-12 15:20:10,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779276725] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:20:10,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:20:10,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 15:20:10,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316212767] [2024-09-12 15:20:10,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:20:10,363 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 15:20:10,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:10,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 15:20:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:20:10,391 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:10,412 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-12 15:20:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 15:20:10,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 15:20:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:10,420 INFO L225 Difference]: With dead ends: 29 [2024-09-12 15:20:10,420 INFO L226 Difference]: Without dead ends: 12 [2024-09-12 15:20:10,423 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-12 15:20:10,426 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:10,428 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:20:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-12 15:20:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-12 15:20:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-09-12 15:20:10,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2024-09-12 15:20:10,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:10,459 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-09-12 15:20:10,460 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:10,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-09-12 15:20:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:20:10,461 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:10,461 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:10,462 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:20:10,462 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:10,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash -34028938, now seen corresponding path program 1 times [2024-09-12 15:20:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:10,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347128411] [2024-09-12 15:20:10,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:10,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:10,737 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-12 15:20:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:10,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347128411] [2024-09-12 15:20:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347128411] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:20:10,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:20:10,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:20:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699356513] [2024-09-12 15:20:10,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:20:10,740 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:20:10,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:20:10,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:20:10,741 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:10,801 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-09-12 15:20:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:20:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 15:20:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:10,803 INFO L225 Difference]: With dead ends: 18 [2024-09-12 15:20:10,803 INFO L226 Difference]: Without dead ends: 13 [2024-09-12 15:20:10,804 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:20:10,806 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:10,807 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:20:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-12 15:20:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-12 15:20:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-09-12 15:20:10,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2024-09-12 15:20:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:10,815 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-09-12 15:20:10,816 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:10,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-09-12 15:20:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 15:20:10,818 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:10,818 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:10,818 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:20:10,819 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:10,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:10,819 INFO L85 PathProgramCache]: Analyzing trace with hash -275924925, now seen corresponding path program 1 times [2024-09-12 15:20:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004113205] [2024-09-12 15:20:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:11,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:11,085 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-12 15:20:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004113205] [2024-09-12 15:20:11,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004113205] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:20:11,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469823824] [2024-09-12 15:20:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:20:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:20:11,094 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-12 15:20:11,096 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-12 15:20:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:11,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 15:20:11,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:20:11,303 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-12 15:20:11,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:20:11,472 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-12 15:20:11,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469823824] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:20:11,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:20:11,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-09-12 15:20:11,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53616813] [2024-09-12 15:20:11,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:20:11,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 15:20:11,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:11,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 15:20:11,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-09-12 15:20:11,476 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:11,598 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-09-12 15:20:11,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 15:20:11,600 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 15:20:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:11,601 INFO L225 Difference]: With dead ends: 23 [2024-09-12 15:20:11,601 INFO L226 Difference]: Without dead ends: 16 [2024-09-12 15:20:11,602 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-09-12 15:20:11,603 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:11,607 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:20:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-12 15:20:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-12 15:20:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-09-12 15:20:11,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2024-09-12 15:20:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:11,612 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-09-12 15:20:11,613 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:11,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-09-12 15:20:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 15:20:11,614 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:11,614 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:11,632 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 15:20:11,815 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-12 15:20:11,815 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:11,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 913198518, now seen corresponding path program 2 times [2024-09-12 15:20:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161561889] [2024-09-12 15:20:11,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:12,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 15:20:12,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161561889] [2024-09-12 15:20:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161561889] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:20:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000106373] [2024-09-12 15:20:12,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:20:12,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:20:12,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:20:12,026 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-12 15:20:12,030 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-12 15:20:12,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:20:12,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:20:12,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-12 15:20:12,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:20:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:20:12,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:20:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:20:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000106373] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:20:12,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:20:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2024-09-12 15:20:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300882493] [2024-09-12 15:20:12,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:20:12,505 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 15:20:12,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 15:20:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2024-09-12 15:20:12,507 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 23 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:12,701 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-09-12 15:20:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 15:20:12,701 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 15:20:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:12,702 INFO L225 Difference]: With dead ends: 18 [2024-09-12 15:20:12,702 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:20:12,703 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2024-09-12 15:20:12,704 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:12,706 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:20:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:20:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:20:12,707 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-12 15:20:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:20:12,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-09-12 15:20:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:12,708 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:20:12,708 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:20:12,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:20:12,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:20:12,714 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 15:20:12,731 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 15:20:12,918 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:20:12,922 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-09-12 15:20:12,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:20:13,063 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:20:13,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:20:13 BoogieIcfgContainer [2024-09-12 15:20:13,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:20:13,079 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:20:13,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:20:13,079 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:20:13,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:20:10" (3/4) ... [2024-09-12 15:20:13,082 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:20:13,085 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:20:13,086 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:20:13,086 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 15:20:13,089 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 15:20:13,090 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 15:20:13,090 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 15:20:13,090 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:20:13,170 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:20:13,170 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:20:13,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:20:13,172 INFO L158 Benchmark]: Toolchain (without parser) took 3786.54ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 30.4MB in the beginning and 44.2MB in the end (delta: -13.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-09-12 15:20:13,174 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 44.0MB. Free memory was 20.6MB in the beginning and 20.6MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:20:13,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.75ms. Allocated memory is still 58.7MB. Free memory was 30.2MB in the beginning and 34.9MB in the end (delta: -4.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-09-12 15:20:13,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.61ms. Allocated memory is still 58.7MB. Free memory was 34.9MB in the beginning and 33.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:20:13,174 INFO L158 Benchmark]: Boogie Preprocessor took 39.93ms. Allocated memory is still 58.7MB. Free memory was 33.9MB in the beginning and 32.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:20:13,175 INFO L158 Benchmark]: RCFGBuilder took 318.58ms. Allocated memory is still 58.7MB. Free memory was 32.3MB in the beginning and 21.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 15:20:13,178 INFO L158 Benchmark]: TraceAbstraction took 3025.18ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 50.8MB in the beginning and 48.3MB in the end (delta: 2.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-09-12 15:20:13,178 INFO L158 Benchmark]: Witness Printer took 92.03ms. Allocated memory is still 86.0MB. Free memory was 48.3MB in the beginning and 44.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:20:13,179 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.19ms. Allocated memory is still 44.0MB. Free memory was 20.6MB in the beginning and 20.6MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.75ms. Allocated memory is still 58.7MB. Free memory was 30.2MB in the beginning and 34.9MB in the end (delta: -4.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.61ms. Allocated memory is still 58.7MB. Free memory was 34.9MB in the beginning and 33.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.93ms. Allocated memory is still 58.7MB. Free memory was 33.9MB in the beginning and 32.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 318.58ms. Allocated memory is still 58.7MB. Free memory was 32.3MB in the beginning and 21.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3025.18ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 50.8MB in the beginning and 48.3MB in the end (delta: 2.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 92.03ms. Allocated memory is still 86.0MB. Free memory was 48.3MB in the beginning and 44.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 38 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 32, 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, 1.5s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 4 NumberOfNonLiveVariables, 109 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 3/33 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: 25]: Loop Invariant Derived loop invariant: (((sn == 0) && (i == 1)) || ((sn <= ((long long) n * 2)) && ((2 + sn) == ((long long) i * 2)))) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-12 15:20:13,208 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