./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/lu.cmp.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 --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/lu.cmp.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 9f7b9e2e2452a973cdb1a73a9c368f26d19387c763b2be4ad10c01e7a31f6598 --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:00,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:20:00,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:20:00,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:20:00,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:20:00,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:20:00,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:20:00,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:20:00,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:20:00,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:20:00,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:20:00,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:20:00,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:20:00,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:20:00,550 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:20:00,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:20:00,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:20:00,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:20:00,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:20:00,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:20:00,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:20:00,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:20:00,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:20:00,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:20:00,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:20:00,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:20:00,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:20:00,556 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:20:00,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:20:00,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:20:00,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:20:00,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:20:00,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:20:00,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:20:00,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:20:00,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:20:00,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:20:00,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:20:00,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:20:00,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:20:00,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:20:00,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:20:00,567 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 -> 9f7b9e2e2452a973cdb1a73a9c368f26d19387c763b2be4ad10c01e7a31f6598 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:00,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:20:00,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:20:00,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:20:00,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:20:00,904 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:20:00,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/lu.cmp.c [2024-09-12 15:20:02,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:20:02,676 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:20:02,677 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/lu.cmp.c [2024-09-12 15:20:02,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9f8da041a/84114fb1b2ce4d778efc1a8a173acfa9/FLAG27ed90171 [2024-09-12 15:20:02,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9f8da041a/84114fb1b2ce4d778efc1a8a173acfa9 [2024-09-12 15:20:02,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:20:02,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:20:02,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:20:02,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:20:02,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:20:02,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:20:02" (1/1) ... [2024-09-12 15:20:02,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76785520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:02, skipping insertion in model container [2024-09-12 15:20:02,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:20:02" (1/1) ... [2024-09-12 15:20:02,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:20:02,910 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/lu.cmp.c[318,331] [2024-09-12 15:20:02,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:20:02,983 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:20:02,995 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/lu.cmp.c[318,331] [2024-09-12 15:20:03,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:20:03,049 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:20:03,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:03 WrapperNode [2024-09-12 15:20:03,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:20:03,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:20:03,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:20:03,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:20:03,058 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:03" (1/1) ... [2024-09-12 15:20:03,068 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:03" (1/1) ... [2024-09-12 15:20:03,076 INFO L138 Inliner]: procedures = 17, calls = 47, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:20:03,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:20:03,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:20:03,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:20:03,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:20:03,088 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:03" (1/1) ... [2024-09-12 15:20:03,088 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:03" (1/1) ... [2024-09-12 15:20:03,092 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:03" (1/1) ... [2024-09-12 15:20:03,107 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-09-12 15:20:03,108 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:03" (1/1) ... [2024-09-12 15:20:03,108 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:03" (1/1) ... [2024-09-12 15:20:03,126 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:03" (1/1) ... [2024-09-12 15:20:03,134 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:03" (1/1) ... [2024-09-12 15:20:03,139 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:03" (1/1) ... [2024-09-12 15:20:03,140 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:03" (1/1) ... [2024-09-12 15:20:03,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:20:03,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:20:03,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:20:03,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:20:03,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:03" (1/1) ... [2024-09-12 15:20:03,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:20:03,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:20:03,190 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:03,197 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:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2024-09-12 15:20:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2024-09-12 15:20:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:20:03,240 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2024-09-12 15:20:03,240 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2024-09-12 15:20:03,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:20:03,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:20:03,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-12 15:20:03,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 15:20:03,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-09-12 15:20:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:20:03,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:20:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-09-12 15:20:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:20:03,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:20:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:20:03,241 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:20:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 15:20:03,335 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:20:03,339 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:20:03,711 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-09-12 15:20:03,712 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:20:03,747 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:20:03,751 INFO L318 CfgBuilder]: Removed 11 assume(true) statements. [2024-09-12 15:20:03,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:20:03 BoogieIcfgContainer [2024-09-12 15:20:03,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:20:03,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:20:03,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:20:03,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:20:03,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:20:02" (1/3) ... [2024-09-12 15:20:03,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6523e805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:20:03, skipping insertion in model container [2024-09-12 15:20:03,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:20:03" (2/3) ... [2024-09-12 15:20:03,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6523e805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:20:03, skipping insertion in model container [2024-09-12 15:20:03,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:20:03" (3/3) ... [2024-09-12 15:20:03,768 INFO L112 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2024-09-12 15:20:03,788 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:20:03,788 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:20:03,860 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:20:03,869 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;@72cb1ca4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:20:03,870 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:20:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 15:20:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:20:03,882 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:03,883 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:03,884 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:03,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1493505331, now seen corresponding path program 1 times [2024-09-12 15:20:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543932513] [2024-09-12 15:20:03,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:03,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:04,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:04,150 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:04,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:04,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543932513] [2024-09-12 15:20:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543932513] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:20:04,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:20:04,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:20:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073257142] [2024-09-12 15:20:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:20:04,159 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:20:04,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:04,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:20:04,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:20:04,187 INFO L87 Difference]: Start difference. First operand has 51 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 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:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:04,497 INFO L93 Difference]: Finished difference Result 119 states and 197 transitions. [2024-09-12 15:20:04,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:20:04,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 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) Word has length 11 [2024-09-12 15:20:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:04,515 INFO L225 Difference]: With dead ends: 119 [2024-09-12 15:20:04,516 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 15:20:04,520 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:20:04,524 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:04,526 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 17 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 15:20:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 15:20:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-09-12 15:20:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:20:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-09-12 15:20:04,567 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2024-09-12 15:20:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:04,568 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-09-12 15:20:04,568 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 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:04,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-09-12 15:20:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:20:04,571 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:04,571 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:04,572 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:20:04,572 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:04,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1505511104, now seen corresponding path program 1 times [2024-09-12 15:20:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:04,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167797669] [2024-09-12 15:20:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:04,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:04,759 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:04,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:04,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167797669] [2024-09-12 15:20:04,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167797669] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:20:04,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:20:04,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:20:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131243272] [2024-09-12 15:20:04,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:20:04,767 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:20:04,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:20:04,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:20:04,768 INFO L87 Difference]: Start difference. First operand 17 states and 19 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), 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:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:04,896 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-09-12 15:20:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:20:04,897 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), 3 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:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:04,898 INFO L225 Difference]: With dead ends: 34 [2024-09-12 15:20:04,899 INFO L226 Difference]: Without dead ends: 22 [2024-09-12 15:20:04,900 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:20:04,901 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:04,902 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:20:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-12 15:20:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2024-09-12 15:20:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:20:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-09-12 15:20:04,913 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-09-12 15:20:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:04,914 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-09-12 15:20:04,914 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), 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:04,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-09-12 15:20:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:20:04,915 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:04,916 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:04,916 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:20:04,916 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:04,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash 774422102, now seen corresponding path program 1 times [2024-09-12 15:20:04,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:04,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69567585] [2024-09-12 15:20:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:04,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:05,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:20:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69567585] [2024-09-12 15:20:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69567585] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:20:05,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:20:05,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:20:05,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080704250] [2024-09-12 15:20:05,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:20:05,060 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:20:05,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:05,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:20:05,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:20:05,062 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:05,159 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-09-12 15:20:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:20:05,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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) Word has length 14 [2024-09-12 15:20:05,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:05,167 INFO L225 Difference]: With dead ends: 40 [2024-09-12 15:20:05,168 INFO L226 Difference]: Without dead ends: 27 [2024-09-12 15:20:05,168 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:20:05,170 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:05,170 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 12 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:20:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-12 15:20:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2024-09-12 15:20:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:20:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-09-12 15:20:05,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2024-09-12 15:20:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:05,183 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-09-12 15:20:05,183 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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:05,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-09-12 15:20:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:20:05,185 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:05,185 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:05,185 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 15:20:05,186 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:05,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:05,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1000585260, now seen corresponding path program 1 times [2024-09-12 15:20:05,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711425575] [2024-09-12 15:20:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:05,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 15:20:05,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:05,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711425575] [2024-09-12 15:20:05,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711425575] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:20:05,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:20:05,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:20:05,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971026164] [2024-09-12 15:20:05,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:20:05,335 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:20:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:20:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:20:05,337 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 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:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:05,493 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-09-12 15:20:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:20:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 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) Word has length 14 [2024-09-12 15:20:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:05,494 INFO L225 Difference]: With dead ends: 32 [2024-09-12 15:20:05,494 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 15:20:05,494 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:20:05,495 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:05,496 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 20 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:20:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 15:20:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-09-12 15:20:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 15:20:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-09-12 15:20:05,505 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 14 [2024-09-12 15:20:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:05,506 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-09-12 15:20:05,506 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 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:05,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-09-12 15:20:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 15:20:05,507 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:05,507 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:05,507 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 15:20:05,508 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:05,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1432810174, now seen corresponding path program 1 times [2024-09-12 15:20:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:05,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707200428] [2024-09-12 15:20:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:05,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:05,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:05,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:20:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 15:20:05,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707200428] [2024-09-12 15:20:05,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707200428] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:20:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630807535] [2024-09-12 15:20:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:05,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:20:05,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:20:05,670 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:05,674 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:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:05,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 15:20:05,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:20:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:20:05,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:20:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 15:20:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630807535] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:20:05,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:20:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2024-09-12 15:20:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661987418] [2024-09-12 15:20:05,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:20:05,922 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 15:20:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 15:20:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:20:05,923 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 15:20:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:06,299 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2024-09-12 15:20:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 15:20:06,300 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-09-12 15:20:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:06,302 INFO L225 Difference]: With dead ends: 85 [2024-09-12 15:20:06,302 INFO L226 Difference]: Without dead ends: 67 [2024-09-12 15:20:06,303 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2024-09-12 15:20:06,304 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 75 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:06,304 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 36 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:20:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-12 15:20:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-09-12 15:20:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 57 states have internal predecessors, (71), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 15:20:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2024-09-12 15:20:06,332 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 25 [2024-09-12 15:20:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:06,335 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2024-09-12 15:20:06,336 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 15:20:06,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2024-09-12 15:20:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 15:20:06,338 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:20:06,338 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 11, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:20:06,351 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:06,538 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:20:06,539 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:20:06,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1440375562, now seen corresponding path program 2 times [2024-09-12 15:20:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:20:06,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648506590] [2024-09-12 15:20:06,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:20:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:20:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:06,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:20:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:06,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-12 15:20:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:06,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-12 15:20:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:20:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-09-12 15:20:06,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:20:06,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648506590] [2024-09-12 15:20:06,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648506590] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:20:06,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103139866] [2024-09-12 15:20:06,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:20:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:20:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:20:06,856 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:06,870 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:06,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 15:20:06,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:20:06,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 15:20:06,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:20:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 4 proven. 116 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-09-12 15:20:07,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:20:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 4 proven. 116 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-09-12 15:20:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103139866] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:20:07,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:20:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2024-09-12 15:20:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600291739] [2024-09-12 15:20:07,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:20:07,204 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 15:20:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:20:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 15:20:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:20:07,205 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 15:20:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:20:07,359 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2024-09-12 15:20:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:20:07,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 63 [2024-09-12 15:20:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:20:07,360 INFO L225 Difference]: With dead ends: 66 [2024-09-12 15:20:07,361 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:20:07,361 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-09-12 15:20:07,362 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:20:07,363 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:20:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:20:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:20:07,365 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:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:20:07,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2024-09-12 15:20:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:20:07,366 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:20:07,366 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 6 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 15:20:07,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:20:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:20:07,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:20:07,371 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 15:20:07,387 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:07,573 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 15:20:07,577 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-09-12 15:20:07,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:20:07,932 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:20:07,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:20:07 BoogieIcfgContainer [2024-09-12 15:20:07,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:20:07,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:20:07,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:20:07,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:20:07,950 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:03" (3/4) ... [2024-09-12 15:20:07,952 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:20:07,956 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ludcmp [2024-09-12 15:20:07,956 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:20:07,956 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs [2024-09-12 15:20:07,956 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:20:07,957 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 15:20:07,963 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2024-09-12 15:20:07,964 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-09-12 15:20:07,964 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 15:20:07,964 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 15:20:07,965 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:20:08,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:20:08,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:20:08,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:20:08,070 INFO L158 Benchmark]: Toolchain (without parser) took 5361.16ms. Allocated memory was 67.1MB in the beginning and 121.6MB in the end (delta: 54.5MB). Free memory was 35.7MB in the beginning and 81.3MB in the end (delta: -45.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-09-12 15:20:08,070 INFO L158 Benchmark]: CDTParser took 1.41ms. Allocated memory is still 54.5MB. Free memory is still 29.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:20:08,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.88ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 40.0MB in the end (delta: -4.5MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-09-12 15:20:08,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.49ms. Allocated memory is still 67.1MB. Free memory was 40.0MB in the beginning and 39.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:20:08,071 INFO L158 Benchmark]: Boogie Preprocessor took 69.34ms. Allocated memory is still 67.1MB. Free memory was 39.0MB in the beginning and 36.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:20:08,071 INFO L158 Benchmark]: RCFGBuilder took 608.71ms. Allocated memory is still 67.1MB. Free memory was 36.3MB in the beginning and 30.7MB in the end (delta: 5.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 15:20:08,071 INFO L158 Benchmark]: TraceAbstraction took 4190.68ms. Allocated memory was 67.1MB in the beginning and 121.6MB in the end (delta: 54.5MB). Free memory was 30.1MB in the beginning and 86.6MB in the end (delta: -56.5MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-09-12 15:20:08,072 INFO L158 Benchmark]: Witness Printer took 120.13ms. Allocated memory is still 121.6MB. Free memory was 86.6MB in the beginning and 81.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:20:08,073 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41ms. Allocated memory is still 54.5MB. Free memory is still 29.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.88ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 40.0MB in the end (delta: -4.5MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.49ms. Allocated memory is still 67.1MB. Free memory was 40.0MB in the beginning and 39.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.34ms. Allocated memory is still 67.1MB. Free memory was 39.0MB in the beginning and 36.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 608.71ms. Allocated memory is still 67.1MB. Free memory was 36.3MB in the beginning and 30.7MB in the end (delta: 5.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4190.68ms. Allocated memory was 67.1MB in the beginning and 121.6MB in the end (delta: 54.5MB). Free memory was 30.1MB in the beginning and 86.6MB in the end (delta: -56.5MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 120.13ms. Allocated memory is still 121.6MB. Free memory was 86.6MB in the beginning and 81.3MB in the end (delta: 5.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: 7]: 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 6 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 39 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 226 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 886 SizeOfPredicates, 3 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 550/794 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: 125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((i <= 49) && (5 == n)) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((i <= 5) && (5 == n)) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-12 15:20:08,105 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