./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_4.c --full-output --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/loop-simple/nested_4.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 fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf --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-11 19:36:14,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:36:14,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:36:14,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:36:14,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:36:14,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:36:14,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:36:14,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:36:14,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:36:14,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:36:14,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:36:14,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:36:14,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:36:14,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:36:14,340 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:36:14,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:36:14,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:36:14,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:36:14,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:36:14,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:36:14,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:36:14,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:36:14,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:36:14,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:36:14,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:36:14,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:36:14,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:36:14,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:36:14,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:36:14,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:36:14,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:36:14,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:36:14,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:36:14,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:36:14,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:36:14,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:36:14,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:36:14,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:36:14,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:36:14,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:36:14,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:36:14,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:36:14,349 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 -> fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf 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-11 19:36:14,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:36:14,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:36:14,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:36:14,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:36:14,622 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:36:14,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_4.c [2024-09-11 19:36:16,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:36:16,226 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:36:16,226 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_4.c [2024-09-11 19:36:16,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/94594a7df/85b665c1a9674a979e29f3993feca9f0/FLAG32f046d48 [2024-09-11 19:36:16,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/94594a7df/85b665c1a9674a979e29f3993feca9f0 [2024-09-11 19:36:16,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:36:16,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:36:16,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:36:16,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:36:16,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:36:16,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145ad35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16, skipping insertion in model container [2024-09-11 19:36:16,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:36:16,423 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/loop-simple/nested_4.c[841,854] [2024-09-11 19:36:16,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:36:16,436 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:36:16,447 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/loop-simple/nested_4.c[841,854] [2024-09-11 19:36:16,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:36:16,465 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:36:16,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16 WrapperNode [2024-09-11 19:36:16,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:36:16,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:36:16,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:36:16,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:36:16,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,492 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2024-09-11 19:36:16,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:36:16,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:36:16,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:36:16,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:36:16,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,510 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-11 19:36:16,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:36:16,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:36:16,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:36:16,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:36:16,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (1/1) ... [2024-09-11 19:36:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:36:16,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:16,550 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-11 19:36:16,552 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-11 19:36:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:36:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:36:16,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:36:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:36:16,657 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:36:16,663 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:36:16,794 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-11 19:36:16,794 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:36:16,828 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:36:16,829 INFO L318 CfgBuilder]: Removed 4 assume(true) statements. [2024-09-11 19:36:16,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:36:16 BoogieIcfgContainer [2024-09-11 19:36:16,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:36:16,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:36:16,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:36:16,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:36:16,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:36:16" (1/3) ... [2024-09-11 19:36:16,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513a0b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:36:16, skipping insertion in model container [2024-09-11 19:36:16,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:36:16" (2/3) ... [2024-09-11 19:36:16,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513a0b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:36:16, skipping insertion in model container [2024-09-11 19:36:16,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:36:16" (3/3) ... [2024-09-11 19:36:16,838 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_4.c [2024-09-11 19:36:16,855 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:36:16,855 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:36:16,912 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:36:16,921 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;@31337089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:36:16,921 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:36:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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-11 19:36:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-11 19:36:16,932 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:16,932 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-11 19:36:16,933 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:16,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2909715, now seen corresponding path program 1 times [2024-09-11 19:36:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:16,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755087956] [2024-09-11 19:36:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:17,073 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-11 19:36:17,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:17,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755087956] [2024-09-11 19:36:17,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755087956] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:17,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:17,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:36:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603757316] [2024-09-11 19:36:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:17,081 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:36:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:36:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:36:17,109 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:36:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:17,135 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2024-09-11 19:36:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:36:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2024-09-11 19:36:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:17,145 INFO L225 Difference]: With dead ends: 25 [2024-09-11 19:36:17,145 INFO L226 Difference]: Without dead ends: 11 [2024-09-11 19:36:17,148 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 19:36:17,152 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:17,153 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-09-11 19:36:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-09-11 19:36:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-11 19:36:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-09-11 19:36:17,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 4 [2024-09-11 19:36:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:17,177 INFO L474 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-09-11 19:36:17,177 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:36:17,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2024-09-11 19:36:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-11 19:36:17,178 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:17,178 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-11 19:36:17,179 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:36:17,179 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:17,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2869353, now seen corresponding path program 1 times [2024-09-11 19:36:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805252384] [2024-09-11 19:36:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:17,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:17,247 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-11 19:36:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805252384] [2024-09-11 19:36:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805252384] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:17,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:17,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:36:17,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262128934] [2024-09-11 19:36:17,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:17,250 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:36:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:36:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:17,252 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:36:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:17,275 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-09-11 19:36:17,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:36:17,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2024-09-11 19:36:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:17,277 INFO L225 Difference]: With dead ends: 21 [2024-09-11 19:36:17,277 INFO L226 Difference]: Without dead ends: 18 [2024-09-11 19:36:17,278 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 19:36:17,279 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:17,279 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-11 19:36:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2024-09-11 19:36:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-11 19:36:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-09-11 19:36:17,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 4 [2024-09-11 19:36:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:17,284 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-09-11 19:36:17,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-11 19:36:17,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2024-09-11 19:36:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:36:17,286 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:17,286 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:17,286 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:36:17,286 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:17,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash -396485313, now seen corresponding path program 1 times [2024-09-11 19:36:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:17,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280830159] [2024-09-11 19:36:17,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:17,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:17,356 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-11 19:36:17,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:17,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280830159] [2024-09-11 19:36:17,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280830159] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:17,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:17,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:36:17,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680121984] [2024-09-11 19:36:17,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:17,358 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:36:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:17,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:36:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:17,362 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11 19:36:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:17,394 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2024-09-11 19:36:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:36:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2024-09-11 19:36:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:17,408 INFO L225 Difference]: With dead ends: 27 [2024-09-11 19:36:17,408 INFO L226 Difference]: Without dead ends: 17 [2024-09-11 19:36:17,409 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 19:36:17,410 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:17,410 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-11 19:36:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2024-09-11 19:36:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-11 19:36:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-09-11 19:36:17,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2024-09-11 19:36:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:17,414 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-09-11 19:36:17,415 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11 19:36:17,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2024-09-11 19:36:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:36:17,416 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:17,416 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:17,416 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:36:17,417 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:17,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash -173137555, now seen corresponding path program 1 times [2024-09-11 19:36:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:17,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875387914] [2024-09-11 19:36:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:17,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:17,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875387914] [2024-09-11 19:36:17,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875387914] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:17,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:17,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:36:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101524292] [2024-09-11 19:36:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:17,483 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:36:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:36:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:17,485 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 19:36:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:17,517 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-09-11 19:36:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:36:17,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2024-09-11 19:36:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:17,518 INFO L225 Difference]: With dead ends: 27 [2024-09-11 19:36:17,519 INFO L226 Difference]: Without dead ends: 16 [2024-09-11 19:36:17,519 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 19:36:17,520 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:17,520 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-11 19:36:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2024-09-11 19:36:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-11 19:36:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2024-09-11 19:36:17,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2024-09-11 19:36:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:17,525 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-09-11 19:36:17,525 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 19:36:17,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2024-09-11 19:36:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 19:36:17,527 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:17,527 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:17,527 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:36:17,528 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:17,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 184291291, now seen corresponding path program 1 times [2024-09-11 19:36:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:17,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5668598] [2024-09-11 19:36:17,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:17,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5668598] [2024-09-11 19:36:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5668598] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:36:17,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:36:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:36:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187899322] [2024-09-11 19:36:17,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:36:17,595 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:36:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:17,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:36:17,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:36:17,596 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11 19:36:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:17,616 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-09-11 19:36:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:36:17,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2024-09-11 19:36:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:17,619 INFO L225 Difference]: With dead ends: 27 [2024-09-11 19:36:17,619 INFO L226 Difference]: Without dead ends: 15 [2024-09-11 19:36:17,620 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 19:36:17,621 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:17,621 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-11 19:36:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-11 19:36:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-11 19:36:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-09-11 19:36:17,631 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2024-09-11 19:36:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:17,631 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-09-11 19:36:17,631 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11 19:36:17,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-09-11 19:36:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 19:36:17,634 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:17,634 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:17,634 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:36:17,635 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:17,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1567007972, now seen corresponding path program 1 times [2024-09-11 19:36:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720513730] [2024-09-11 19:36:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:17,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720513730] [2024-09-11 19:36:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720513730] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277881671] [2024-09-11 19:36:17,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:17,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:17,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:17,726 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-11 19:36:17,728 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-11 19:36:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:17,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-11 19:36:17,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:17,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277881671] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:17,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:17,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-11 19:36:17,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701626548] [2024-09-11 19:36:17,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:17,855 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:36:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:17,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:36:17,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:36:17,857 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-11 19:36:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:17,873 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-09-11 19:36:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:36:17,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) Word has length 14 [2024-09-11 19:36:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:17,874 INFO L225 Difference]: With dead ends: 31 [2024-09-11 19:36:17,874 INFO L226 Difference]: Without dead ends: 18 [2024-09-11 19:36:17,875 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:36:17,876 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:17,876 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-11 19:36:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-11 19:36:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-11 19:36:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-09-11 19:36:17,881 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2024-09-11 19:36:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:17,882 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-09-11 19:36:17,883 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-11 19:36:17,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-09-11 19:36:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 19:36:17,884 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:17,884 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:17,896 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:36:18,085 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:36:18,086 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:18,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1382721509, now seen corresponding path program 2 times [2024-09-11 19:36:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:18,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857701632] [2024-09-11 19:36:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:36:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:18,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857701632] [2024-09-11 19:36:18,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857701632] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:18,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661304633] [2024-09-11 19:36:18,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:36:18,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:18,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:18,152 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-11 19:36:18,154 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-11 19:36:18,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:36:18,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:18,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:36:18,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:18,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:36:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661304633] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:18,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:18,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-11 19:36:18,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945101423] [2024-09-11 19:36:18,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:18,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:36:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:18,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:36:18,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:36:18,298 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-11 19:36:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:18,457 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-09-11 19:36:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 19:36:18,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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) Word has length 17 [2024-09-11 19:36:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:18,458 INFO L225 Difference]: With dead ends: 53 [2024-09-11 19:36:18,458 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 19:36:18,459 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-11 19:36:18,460 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:18,461 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 34 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 19:36:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2024-09-11 19:36:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-11 19:36:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-09-11 19:36:18,467 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2024-09-11 19:36:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:18,467 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-09-11 19:36:18,467 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-11 19:36:18,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-09-11 19:36:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 19:36:18,469 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:18,469 INFO L216 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:36:18,481 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:36:18,671 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:36:18,672 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:18,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2140739283, now seen corresponding path program 3 times [2024-09-11 19:36:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:18,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633086728] [2024-09-11 19:36:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:18,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-11 19:36:18,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:18,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633086728] [2024-09-11 19:36:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633086728] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057298638] [2024-09-11 19:36:18,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:36:18,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:18,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:18,778 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-11 19:36:18,779 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-11 19:36:18,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-11 19:36:18,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:18,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-11 19:36:18,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-09-11 19:36:18,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-09-11 19:36:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057298638] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:18,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:18,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-09-11 19:36:18,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543821208] [2024-09-11 19:36:18,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:18,945 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 19:36:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:18,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 19:36:18,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:36:18,946 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-11 19:36:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:19,168 INFO L93 Difference]: Finished difference Result 292 states and 343 transitions. [2024-09-11 19:36:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 19:36:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) Word has length 28 [2024-09-11 19:36:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:19,171 INFO L225 Difference]: With dead ends: 292 [2024-09-11 19:36:19,171 INFO L226 Difference]: Without dead ends: 265 [2024-09-11 19:36:19,172 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:36:19,173 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 70 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:19,173 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:36:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-09-11 19:36:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 185. [2024-09-11 19:36:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.1576086956521738) internal successors, (213), 184 states have internal predecessors, (213), 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-11 19:36:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2024-09-11 19:36:19,223 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 28 [2024-09-11 19:36:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:19,223 INFO L474 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2024-09-11 19:36:19,223 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-11 19:36:19,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2024-09-11 19:36:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-09-11 19:36:19,234 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:19,234 INFO L216 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1] [2024-09-11 19:36:19,250 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:36:19,438 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-11 19:36:19,438 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:19,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash 614256617, now seen corresponding path program 4 times [2024-09-11 19:36:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595283378] [2024-09-11 19:36:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-09-11 19:36:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595283378] [2024-09-11 19:36:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595283378] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342069066] [2024-09-11 19:36:19,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:36:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:19,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:36:19,765 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 19:36:19,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:36:19,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:19,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:36:19,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-09-11 19:36:19,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-09-11 19:36:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342069066] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:20,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-11 19:36:20,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214309877] [2024-09-11 19:36:20,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:20,015 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:36:20,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:36:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:36:20,016 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-11 19:36:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:20,109 INFO L93 Difference]: Finished difference Result 636 states and 753 transitions. [2024-09-11 19:36:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:36:20,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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) Word has length 184 [2024-09-11 19:36:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:20,114 INFO L225 Difference]: With dead ends: 636 [2024-09-11 19:36:20,116 INFO L226 Difference]: Without dead ends: 473 [2024-09-11 19:36:20,117 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:36:20,117 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:20,119 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-09-11 19:36:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2024-09-11 19:36:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.1292372881355932) internal successors, (533), 472 states have internal predecessors, (533), 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-11 19:36:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 533 transitions. [2024-09-11 19:36:20,206 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 533 transitions. Word has length 184 [2024-09-11 19:36:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:20,206 INFO L474 AbstractCegarLoop]: Abstraction has 473 states and 533 transitions. [2024-09-11 19:36:20,207 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-11 19:36:20,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 533 transitions. [2024-09-11 19:36:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-09-11 19:36:20,220 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:20,220 INFO L216 NwaCegarLoop]: trace histogram [288, 48, 48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1] [2024-09-11 19:36:20,237 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:36:20,421 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:20,421 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:20,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash -983278615, now seen corresponding path program 5 times [2024-09-11 19:36:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:20,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746440440] [2024-09-11 19:36:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 22231 proven. 1853 refuted. 0 times theorem prover too weak. 34974 trivial. 0 not checked. [2024-09-11 19:36:20,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746440440] [2024-09-11 19:36:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746440440] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444885857] [2024-09-11 19:36:20,883 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 19:36:20,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:20,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:36:20,887 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 19:36:21,050 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2024-09-11 19:36:21,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:21,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:36:21,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 37054 proven. 1853 refuted. 0 times theorem prover too weak. 20151 trivial. 0 not checked. [2024-09-11 19:36:21,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 37054 proven. 1853 refuted. 0 times theorem prover too weak. 20151 trivial. 0 not checked. [2024-09-11 19:36:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444885857] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:21,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-11 19:36:21,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717581371] [2024-09-11 19:36:21,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:21,411 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:36:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:21,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:36:21,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:36:21,412 INFO L87 Difference]: Start difference. First operand 473 states and 533 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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-11 19:36:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:21,642 INFO L93 Difference]: Finished difference Result 1741 states and 1974 transitions. [2024-09-11 19:36:21,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:36:21,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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) Word has length 472 [2024-09-11 19:36:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:21,649 INFO L225 Difference]: With dead ends: 1741 [2024-09-11 19:36:21,649 INFO L226 Difference]: Without dead ends: 1385 [2024-09-11 19:36:21,652 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 940 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:36:21,654 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:21,654 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:36:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-09-11 19:36:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1385. [2024-09-11 19:36:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 1.125) internal successors, (1557), 1384 states have internal predecessors, (1557), 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-11 19:36:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1557 transitions. [2024-09-11 19:36:21,842 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1557 transitions. Word has length 472 [2024-09-11 19:36:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:21,843 INFO L474 AbstractCegarLoop]: Abstraction has 1385 states and 1557 transitions. [2024-09-11 19:36:21,843 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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-11 19:36:21,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1557 transitions. [2024-09-11 19:36:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2024-09-11 19:36:21,890 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:36:21,890 INFO L216 NwaCegarLoop]: trace histogram [864, 144, 144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1] [2024-09-11 19:36:21,912 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 19:36:22,091 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 19:36:22,092 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:36:22,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash -69123607, now seen corresponding path program 6 times [2024-09-11 19:36:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:36:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651761124] [2024-09-11 19:36:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:36:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:36:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:36:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 0 proven. 399910 refuted. 0 times theorem prover too weak. 132612 trivial. 0 not checked. [2024-09-11 19:36:24,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:36:24,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651761124] [2024-09-11 19:36:24,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651761124] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:36:24,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678259430] [2024-09-11 19:36:24,820 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 19:36:24,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:36:24,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:36:24,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:36:24,823 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 19:36:25,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 233 check-sat command(s) [2024-09-11 19:36:25,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:36:25,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 2198 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 19:36:25,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:36:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 209210 proven. 792 refuted. 0 times theorem prover too weak. 322520 trivial. 0 not checked. [2024-09-11 19:36:26,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:36:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 199954 proven. 10048 refuted. 0 times theorem prover too weak. 322520 trivial. 0 not checked. [2024-09-11 19:36:29,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678259430] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:36:29,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:36:29,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 21, 21] total 43 [2024-09-11 19:36:29,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137822120] [2024-09-11 19:36:29,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:36:29,032 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-09-11 19:36:29,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:36:29,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-09-11 19:36:29,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2024-09-11 19:36:29,034 INFO L87 Difference]: Start difference. First operand 1385 states and 1557 transitions. Second operand has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 43 states have internal predecessors, (134), 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-11 19:36:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:36:31,570 INFO L93 Difference]: Finished difference Result 3409 states and 3837 transitions. [2024-09-11 19:36:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-09-11 19:36:31,571 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 43 states have internal predecessors, (134), 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) Word has length 1384 [2024-09-11 19:36:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:36:31,578 INFO L225 Difference]: With dead ends: 3409 [2024-09-11 19:36:31,578 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:36:31,587 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2867 GetRequests, 2731 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5663 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2980, Invalid=15926, Unknown=0, NotChecked=0, Total=18906 [2024-09-11 19:36:31,588 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 192 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-11 19:36:31,589 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 80 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-11 19:36:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:36:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:36:31,590 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-11 19:36:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:36:31,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1384 [2024-09-11 19:36:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:36:31,592 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:36:31,593 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 43 states have internal predecessors, (134), 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-11 19:36:31,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:36:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:36:31,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:36:31,596 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:36:31,616 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 19:36:31,800 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-11 19:36:31,804 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-09-11 19:36:31,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:37:50,491 WARN L293 SmtUtils]: Spent 1.26m on a formula simplification. DAG size of input: 1746 DAG size of output: 1554 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-09-11 19:38:38,574 WARN L293 SmtUtils]: Spent 45.13s on a formula simplification. DAG size of input: 1554 DAG size of output: 39 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-11 19:38:38,704 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:38:38,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:38:38 BoogieIcfgContainer [2024-09-11 19:38:38,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:38:38,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:38:38,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:38:38,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:38:38,733 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:36:16" (3/4) ... [2024-09-11 19:38:38,735 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:38:38,741 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-09-11 19:38:38,741 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 19:38:38,741 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:38:38,741 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:38:38,828 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:38:38,829 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:38:38,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:38:38,830 INFO L158 Benchmark]: Toolchain (without parser) took 142582.10ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 117.5MB in the beginning and 762.5MB in the end (delta: -645.0MB). Peak memory consumption was 416.7MB. Max. memory is 16.1GB. [2024-09-11 19:38:38,830 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory was 85.9MB in the beginning and 85.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:38:38,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.86ms. Allocated memory is still 148.9MB. Free memory was 117.5MB in the beginning and 105.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:38:38,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.00ms. Allocated memory is still 148.9MB. Free memory was 105.9MB in the beginning and 104.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:38:38,830 INFO L158 Benchmark]: Boogie Preprocessor took 25.13ms. Allocated memory is still 148.9MB. Free memory was 104.4MB in the beginning and 102.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:38:38,831 INFO L158 Benchmark]: RCFGBuilder took 310.47ms. Allocated memory is still 148.9MB. Free memory was 102.8MB in the beginning and 91.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:38:38,832 INFO L158 Benchmark]: TraceAbstraction took 141901.62ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 91.3MB in the beginning and 767.8MB in the end (delta: -676.4MB). Peak memory consumption was 731.6MB. Max. memory is 16.1GB. [2024-09-11 19:38:38,832 INFO L158 Benchmark]: Witness Printer took 96.00ms. Allocated memory is still 1.2GB. Free memory was 767.8MB in the beginning and 762.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:38:38,834 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory was 85.9MB in the beginning and 85.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.86ms. Allocated memory is still 148.9MB. Free memory was 117.5MB in the beginning and 105.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.00ms. Allocated memory is still 148.9MB. Free memory was 105.9MB in the beginning and 104.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.13ms. Allocated memory is still 148.9MB. Free memory was 104.4MB in the beginning and 102.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.47ms. Allocated memory is still 148.9MB. Free memory was 102.8MB in the beginning and 91.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 141901.62ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 91.3MB in the beginning and 767.8MB in the end (delta: -676.4MB). Peak memory consumption was 731.6MB. Max. memory is 16.1GB. * Witness Printer took 96.00ms. Allocated memory is still 1.2GB. Free memory was 767.8MB in the beginning and 762.5MB 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: 32]: 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 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 11, TraceHistogramMax: 864, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 219 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1242 IncrementalHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 110 mSDtfsCounter, 1242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4346 GetRequests, 4149 SyntacticMatches, 4 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5801 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1385occurred in iteration=10, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 100 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 4236 NumberOfCodeBlocks, 3344 NumberOfCodeBlocksAsserted, 300 NumberOfCheckSat, 6312 ConstructedInterpolants, 0 QuantifiedInterpolants, 13328 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3222 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 1378759/1795254 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((((((((a <= 5) && (b <= 5)) && (2 == c)) || ((((a <= 5) && (5 == c)) && (b <= 5)) && (3 == d))) || ((((d == 1) && (a <= 5)) && (5 == c)) && (b <= 5))) || (((a <= 5) && (b <= 5)) && (3 == c))) || ((((a <= 5) && (5 == c)) && (b <= 5)) && (2 == d))) || (((c == 0) && (a <= 5)) && (b <= 5))) || ((((a <= 5) && (5 == c)) && (b <= 5)) && (d == 4))) || (((a <= 5) && (b <= 5)) && (c == 4))) || (((c == 1) && (a <= 5)) && (b <= 5))) || ((((a <= 5) && (5 == c)) && (b <= 5)) && (6 == d))) || ((((a <= 5) && (5 == c)) && (b <= 5)) && (d == 0))) || ((((5 == d) && (a <= 5)) && (5 == c)) && (b <= 5))) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((a <= 5) && (6 == d)) && (b <= 6)) && (6 == c)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((a <= 6) && (6 == b)) && (6 == d)) && (6 == c)) - InvariantResult [Line: 31]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((a <= 5) && (b <= 5)) && (2 == c)) || (((a <= 5) && (5 == c)) && (b <= 5))) || (((a <= 5) && (b <= 5)) && (3 == c))) || (((c == 0) && (a <= 5)) && (b <= 5))) || (((a <= 5) && (b <= 5)) && (c == 4))) || (((c == 1) && (a <= 5)) && (b <= 5))) || ((((a <= 5) && (b <= 5)) && (6 == d)) && (6 == c))) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:38:38,864 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE