./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/ddlm2013.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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 27b49876 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/ddlm2013.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 65bd222d84b3d0ffad0fae15432ef5f02ecc91b1ed6d337cf01ace7c551e4ada --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-27b4987-m [2024-09-21 11:24:59,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 11:24:59,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 11:24:59,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 11:24:59,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 11:24:59,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 11:24:59,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 11:24:59,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 11:24:59,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 11:24:59,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 11:24:59,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 11:24:59,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 11:24:59,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 11:24:59,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 11:24:59,252 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 11:24:59,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 11:24:59,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 11:24:59,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 11:24:59,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 11:24:59,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 11:24:59,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 11:24:59,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 11:24:59,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 11:24:59,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 11:24:59,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 11:24:59,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 11:24:59,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 11:24:59,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 11:24:59,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 11:24:59,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 11:24:59,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 11:24:59,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 11:24:59,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:24:59,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 11:24:59,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 11:24:59,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 11:24:59,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 11:24:59,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 11:24:59,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 11:24:59,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 11:24:59,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 11:24:59,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 11:24:59,264 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 -> 65bd222d84b3d0ffad0fae15432ef5f02ecc91b1ed6d337cf01ace7c551e4ada Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-21 11:24:59,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 11:24:59,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 11:24:59,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 11:24:59,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 11:24:59,538 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 11:24:59,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/ddlm2013.i [2024-09-21 11:25:00,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 11:25:01,069 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 11:25:01,069 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/ddlm2013.i [2024-09-21 11:25:01,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/32cbfd18c/0c4e7e7dc04649faa56ff8fd601c52f5/FLAG0f94aa769 [2024-09-21 11:25:01,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/32cbfd18c/0c4e7e7dc04649faa56ff8fd601c52f5 [2024-09-21 11:25:01,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 11:25:01,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 11:25:01,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 11:25:01,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 11:25:01,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 11:25:01,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e2c5f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01, skipping insertion in model container [2024-09-21 11:25:01,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 11:25:01,288 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/ddlm2013.i[895,908] [2024-09-21 11:25:01,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:25:01,317 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 11:25:01,352 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/ddlm2013.i[895,908] [2024-09-21 11:25:01,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:25:01,399 INFO L204 MainTranslator]: Completed translation [2024-09-21 11:25:01,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01 WrapperNode [2024-09-21 11:25:01,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 11:25:01,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 11:25:01,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 11:25:01,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 11:25:01,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,425 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 11:25:01,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 11:25:01,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 11:25:01,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 11:25:01,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 11:25:01,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,452 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-21 11:25:01,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 11:25:01,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 11:25:01,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 11:25:01,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 11:25:01,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (1/1) ... [2024-09-21 11:25:01,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:25:01,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:01,491 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-21 11:25:01,493 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-21 11:25:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 11:25:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 11:25:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 11:25:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 11:25:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 11:25:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 11:25:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 11:25:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 11:25:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-21 11:25:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-21 11:25:01,586 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 11:25:01,587 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 11:25:01,697 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-21 11:25:01,697 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 11:25:01,713 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 11:25:01,714 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-21 11:25:01,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:01 BoogieIcfgContainer [2024-09-21 11:25:01,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 11:25:01,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 11:25:01,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 11:25:01,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 11:25:01,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:25:01" (1/3) ... [2024-09-21 11:25:01,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0d4b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:25:01, skipping insertion in model container [2024-09-21 11:25:01,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:01" (2/3) ... [2024-09-21 11:25:01,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0d4b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:25:01, skipping insertion in model container [2024-09-21 11:25:01,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:01" (3/3) ... [2024-09-21 11:25:01,720 INFO L112 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2024-09-21 11:25:01,735 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 11:25:01,735 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 11:25:01,787 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 11:25:01,795 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;@18450b3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 11:25:01,796 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 11:25:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 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-21 11:25:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-21 11:25:01,812 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:01,812 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:01,813 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:01,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1442839998, now seen corresponding path program 1 times [2024-09-21 11:25:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668703568] [2024-09-21 11:25:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:01,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:01,966 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-21 11:25:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:01,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668703568] [2024-09-21 11:25:01,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668703568] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:01,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-21 11:25:01,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214276648] [2024-09-21 11:25:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:01,978 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-21 11:25:01,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:02,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-21 11:25:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-21 11:25:02,002 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-21 11:25:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:02,020 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-09-21 11:25:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-21 11:25:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2024-09-21 11:25:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:02,028 INFO L225 Difference]: With dead ends: 33 [2024-09-21 11:25:02,029 INFO L226 Difference]: Without dead ends: 15 [2024-09-21 11:25:02,031 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-21 11:25:02,036 INFO L434 NwaCegarLoop]: 22 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, 22 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-21 11:25:02,037 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-21 11:25:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-21 11:25:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-21 11:25:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-09-21 11:25:02,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2024-09-21 11:25:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:02,064 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-09-21 11:25:02,064 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-21 11:25:02,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-09-21 11:25:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-21 11:25:02,065 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:02,065 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:02,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 11:25:02,066 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:02,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -851694555, now seen corresponding path program 1 times [2024-09-21 11:25:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467297868] [2024-09-21 11:25:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:02,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:02,413 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-21 11:25:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:02,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467297868] [2024-09-21 11:25:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467297868] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:02,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:02,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-21 11:25:02,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421412931] [2024-09-21 11:25:02,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:02,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 11:25:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:02,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 11:25:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-21 11:25:02,418 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-21 11:25:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:02,466 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-09-21 11:25:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-21 11:25:02,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2024-09-21 11:25:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:02,467 INFO L225 Difference]: With dead ends: 23 [2024-09-21 11:25:02,468 INFO L226 Difference]: Without dead ends: 17 [2024-09-21 11:25:02,468 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-21 11:25:02,469 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:02,470 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-21 11:25:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-21 11:25:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-09-21 11:25:02,475 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2024-09-21 11:25:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:02,476 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-09-21 11:25:02,476 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-21 11:25:02,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-09-21 11:25:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-21 11:25:02,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:02,478 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:02,478 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 11:25:02,478 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:02,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1149051831, now seen corresponding path program 1 times [2024-09-21 11:25:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:02,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027625783] [2024-09-21 11:25:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:02,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:02,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:02,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027625783] [2024-09-21 11:25:02,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027625783] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:02,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998833327] [2024-09-21 11:25:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:02,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:02,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:02,955 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-21 11:25:02,957 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-21 11:25:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:03,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-21 11:25:03,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:03,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998833327] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:03,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:03,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-09-21 11:25:03,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571476400] [2024-09-21 11:25:03,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:03,258 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-21 11:25:03,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:03,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-21 11:25:03,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-09-21 11:25:03,260 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 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-21 11:25:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:03,354 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-09-21 11:25:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-21 11:25:03,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 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 16 [2024-09-21 11:25:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:03,355 INFO L225 Difference]: With dead ends: 28 [2024-09-21 11:25:03,355 INFO L226 Difference]: Without dead ends: 22 [2024-09-21 11:25:03,356 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-09-21 11:25:03,358 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:03,359 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 102 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 11:25:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-21 11:25:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-09-21 11:25:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-21 11:25:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-09-21 11:25:03,366 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2024-09-21 11:25:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:03,367 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-09-21 11:25:03,368 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 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-21 11:25:03,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-09-21 11:25:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-21 11:25:03,369 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:03,369 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:03,386 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-21 11:25:03,573 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-21 11:25:03,574 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:03,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash -447987253, now seen corresponding path program 1 times [2024-09-21 11:25:03,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:03,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533373332] [2024-09-21 11:25:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:03,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:03,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-21 11:25:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:03,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533373332] [2024-09-21 11:25:03,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533373332] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:03,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:03,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 11:25:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521354717] [2024-09-21 11:25:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:03,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 11:25:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 11:25:03,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:25:03,600 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-21 11:25:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:03,612 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-21 11:25:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 11:25:03,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 16 [2024-09-21 11:25:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:03,613 INFO L225 Difference]: With dead ends: 31 [2024-09-21 11:25:03,614 INFO L226 Difference]: Without dead ends: 20 [2024-09-21 11:25:03,614 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:25:03,615 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:03,615 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-21 11:25:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-21 11:25:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-09-21 11:25:03,625 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2024-09-21 11:25:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:03,625 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-09-21 11:25:03,625 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-21 11:25:03,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-09-21 11:25:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-21 11:25:03,627 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:03,627 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:03,627 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-21 11:25:03,627 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:03,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash 797870501, now seen corresponding path program 2 times [2024-09-21 11:25:03,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:03,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953134716] [2024-09-21 11:25:03,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:03,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:03,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:03,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:03,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953134716] [2024-09-21 11:25:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953134716] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:03,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597018417] [2024-09-21 11:25:03,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-21 11:25:03,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:03,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:03,938 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-21 11:25:03,940 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-21 11:25:03,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-21 11:25:03,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:03,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-21 11:25:03,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:04,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597018417] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:04,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:04,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-09-21 11:25:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945290442] [2024-09-21 11:25:04,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:04,327 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-21 11:25:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:04,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-21 11:25:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-09-21 11:25:04,328 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 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-21 11:25:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:04,749 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-09-21 11:25:04,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-21 11:25:04,749 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 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 19 [2024-09-21 11:25:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:04,750 INFO L225 Difference]: With dead ends: 51 [2024-09-21 11:25:04,750 INFO L226 Difference]: Without dead ends: 30 [2024-09-21 11:25:04,751 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2024-09-21 11:25:04,752 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:04,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-21 11:25:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-21 11:25:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-09-21 11:25:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-21 11:25:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-09-21 11:25:04,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2024-09-21 11:25:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:04,760 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-09-21 11:25:04,760 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 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-21 11:25:04,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-09-21 11:25:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-21 11:25:04,761 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:04,761 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:04,777 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-21 11:25:04,965 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:04,966 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:04,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:04,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1271204789, now seen corresponding path program 1 times [2024-09-21 11:25:04,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887655164] [2024-09-21 11:25:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:05,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-21 11:25:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887655164] [2024-09-21 11:25:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887655164] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138306117] [2024-09-21 11:25:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:05,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:05,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:05,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 11:25:05,074 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-21 11:25:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:05,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-21 11:25:05,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-21 11:25:05,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-21 11:25:05,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138306117] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:05,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-21 11:25:05,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 7 [2024-09-21 11:25:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829757070] [2024-09-21 11:25:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:05,166 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 11:25:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 11:25:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:25:05,167 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-21 11:25:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:05,179 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-09-21 11:25:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 11:25:05,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 22 [2024-09-21 11:25:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:05,182 INFO L225 Difference]: With dead ends: 23 [2024-09-21 11:25:05,182 INFO L226 Difference]: Without dead ends: 0 [2024-09-21 11:25:05,182 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:25:05,183 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:05,183 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-21 11:25:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-21 11:25:05,184 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-21 11:25:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-21 11:25:05,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-09-21 11:25:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:05,185 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-21 11:25:05,185 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-21 11:25:05,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-21 11:25:05,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-21 11:25:05,190 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-21 11:25:05,207 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-21 11:25:05,391 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-21 11:25:05,394 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-09-21 11:25:05,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-21 11:25:05,626 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-21 11:25:05,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 11:25:05 BoogieIcfgContainer [2024-09-21 11:25:05,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-21 11:25:05,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-21 11:25:05,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-21 11:25:05,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-21 11:25:05,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:01" (3/4) ... [2024-09-21 11:25:05,644 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-21 11:25:05,687 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-21 11:25:05,688 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-21 11:25:05,688 INFO L158 Benchmark]: Toolchain (without parser) took 4587.95ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 113.1MB in the beginning and 117.6MB in the end (delta: -4.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-09-21 11:25:05,688 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:25:05,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.96ms. Allocated memory is still 169.9MB. Free memory was 113.1MB in the beginning and 143.5MB in the end (delta: -30.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-21 11:25:05,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.61ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 142.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:25:05,689 INFO L158 Benchmark]: Boogie Preprocessor took 33.24ms. Allocated memory is still 169.9MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:25:05,689 INFO L158 Benchmark]: RCFGBuilder took 254.03ms. Allocated memory is still 169.9MB. Free memory was 140.4MB in the beginning and 128.6MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-21 11:25:05,690 INFO L158 Benchmark]: TraceAbstraction took 3925.27ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 127.8MB in the beginning and 119.7MB in the end (delta: 8.2MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-09-21 11:25:05,690 INFO L158 Benchmark]: Witness Printer took 45.93ms. Allocated memory is still 205.5MB. Free memory was 119.7MB in the beginning and 117.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:25:05,691 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.22ms. Allocated memory is still 96.5MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.96ms. Allocated memory is still 169.9MB. Free memory was 113.1MB in the beginning and 143.5MB in the end (delta: -30.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.61ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 142.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.24ms. Allocated memory is still 169.9MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 254.03ms. Allocated memory is still 169.9MB. Free memory was 140.4MB in the beginning and 128.6MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3925.27ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 127.8MB in the beginning and 119.7MB in the end (delta: 8.2MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Witness Printer took 45.93ms. Allocated memory is still 205.5MB. Free memory was 119.7MB in the beginning and 117.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 19]: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 88 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=5, InterpolantAutomatonStates: 35, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 903 SizeOfPredicates, 4 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 41/74 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: 35]: Loop Invariant Derived loop invariant: ((flag == 0) || (((0 == (i % 2)) && (a == b)) && ((((long long) a + 1) % 4294967296) == ((((long long) b + j) + ((unsigned long long) i * 4294967295)) % 4294967296)))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-21 11:25:05,718 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