./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/large_const.i --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-invgen/large_const.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 142d17131671d2eab991ea08656e3b8bfe555dee984fe7672c9a027e971df0f8 --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:22:34,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:22:34,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:22:34,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:22:34,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:22:34,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:22:34,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:22:34,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:22:34,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:22:34,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:22:34,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:22:34,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:22:34,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:22:34,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:22:34,790 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:22:34,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:22:34,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:22:34,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:22:34,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:22:34,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:22:34,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:22:34,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:22:34,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:22:34,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:22:34,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:22:34,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:22:34,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:22:34,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:22:34,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:22:34,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:22:34,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:22:34,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:22:34,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:34,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:22:34,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:22:34,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:22:34,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:22:34,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:22:34,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:22:34,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:22:34,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:22:34,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:22:34,799 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 -> 142d17131671d2eab991ea08656e3b8bfe555dee984fe7672c9a027e971df0f8 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:22:34,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:22:34,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:22:34,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:22:34,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:22:34,992 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:22:34,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/large_const.i [2024-09-11 19:22:36,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:22:36,294 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:22:36,295 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/large_const.i [2024-09-11 19:22:36,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/da7e2630a/b0f439ad9d5b4e4cb5a17db261c4f138/FLAG97113a890 [2024-09-11 19:22:36,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/da7e2630a/b0f439ad9d5b4e4cb5a17db261c4f138 [2024-09-11 19:22:36,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:22:36,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:22:36,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:36,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:22:36,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:22:36,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da12571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36, skipping insertion in model container [2024-09-11 19:22:36,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:22:36,875 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-invgen/large_const.i[893,906] [2024-09-11 19:22:36,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:36,901 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:22:36,909 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-invgen/large_const.i[893,906] [2024-09-11 19:22:36,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:36,927 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:22:36,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36 WrapperNode [2024-09-11 19:22:36,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:36,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:36,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:22:36,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:22:36,933 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:22:36" (1/1) ... [2024-09-11 19:22:36,939 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:22:36" (1/1) ... [2024-09-11 19:22:36,951 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-09-11 19:22:36,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:36,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:22:36,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:22:36,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:22:36,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,967 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:22:36,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:22:36,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:22:36,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:22:36,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:22:36,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (1/1) ... [2024-09-11 19:22:36,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:36,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:37,002 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:22:37,005 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:22:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:22:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:22:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:22:37,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:22:37,092 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:22:37,093 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:22:37,216 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-11 19:22:37,216 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:22:37,243 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:22:37,244 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:22:37,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:37 BoogieIcfgContainer [2024-09-11 19:22:37,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:22:37,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:22:37,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:22:37,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:22:37,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:22:36" (1/3) ... [2024-09-11 19:22:37,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd1d2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:37, skipping insertion in model container [2024-09-11 19:22:37,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:36" (2/3) ... [2024-09-11 19:22:37,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd1d2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:37, skipping insertion in model container [2024-09-11 19:22:37,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:37" (3/3) ... [2024-09-11 19:22:37,253 INFO L112 eAbstractionObserver]: Analyzing ICFG large_const.i [2024-09-11 19:22:37,267 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:22:37,267 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:22:37,316 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:22:37,323 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;@759144e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:22:37,324 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:22:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 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:22:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:22:37,332 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:37,334 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:37,334 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:37,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:37,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1353575195, now seen corresponding path program 1 times [2024-09-11 19:22:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656720986] [2024-09-11 19:22:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:37,452 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:22:37,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:37,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656720986] [2024-09-11 19:22:37,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656720986] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:37,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:37,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:22:37,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603485914] [2024-09-11 19:22:37,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:37,458 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:22:37,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:22:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:22:37,499 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 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 3.5) internal successors, (7), 2 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:22:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:37,528 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2024-09-11 19:22:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:22:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:22:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:37,536 INFO L225 Difference]: With dead ends: 24 [2024-09-11 19:22:37,536 INFO L226 Difference]: Without dead ends: 12 [2024-09-11 19:22:37,538 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:22:37,540 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:37,541 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-11 19:22:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-11 19:22:37,562 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:22:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-09-11 19:22:37,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2024-09-11 19:22:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:37,564 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-09-11 19:22:37,566 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:22:37,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2024-09-11 19:22:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:22:37,567 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:37,568 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:37,568 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:22:37,569 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:37,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1372045615, now seen corresponding path program 1 times [2024-09-11 19:22:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:37,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748328605] [2024-09-11 19:22:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:37,697 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:22:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748328605] [2024-09-11 19:22:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748328605] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:37,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:37,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436424199] [2024-09-11 19:22:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:37,699 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:37,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:37,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:37,700 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:22:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:37,719 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-09-11 19:22:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:37,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:22:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:37,720 INFO L225 Difference]: With dead ends: 20 [2024-09-11 19:22:37,720 INFO L226 Difference]: Without dead ends: 13 [2024-09-11 19:22:37,720 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:37,721 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:37,722 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-11 19:22:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-11 19:22:37,726 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:22:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-09-11 19:22:37,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2024-09-11 19:22:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:37,728 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-09-11 19:22:37,728 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:22:37,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2024-09-11 19:22:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:22:37,731 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:37,731 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:37,731 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:22:37,731 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:37,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1277144562, now seen corresponding path program 1 times [2024-09-11 19:22:37,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:37,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622631407] [2024-09-11 19:22:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:37,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:37,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622631407] [2024-09-11 19:22:37,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622631407] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:37,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802870427] [2024-09-11 19:22:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:37,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:37,896 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:22:37,898 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:22:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:37,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:22:37,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:38,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802870427] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:38,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:38,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-11 19:22:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651555228] [2024-09-11 19:22:38,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:38,064 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:22:38,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:38,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:22:38,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:22:38,065 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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:22:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:38,191 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-09-11 19:22:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:22:38,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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:22:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:38,193 INFO L225 Difference]: With dead ends: 39 [2024-09-11 19:22:38,193 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 19:22:38,193 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:22:38,194 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:38,194 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 74 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 19:22:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2024-09-11 19:22:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:22:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-09-11 19:22:38,207 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2024-09-11 19:22:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:38,208 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-09-11 19:22:38,208 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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:22:38,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-09-11 19:22:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:22:38,209 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:38,209 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:38,222 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:38,410 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:38,410 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:38,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:38,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1247080393, now seen corresponding path program 1 times [2024-09-11 19:22:38,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:38,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309621698] [2024-09-11 19:22:38,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:38,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309621698] [2024-09-11 19:22:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309621698] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418229050] [2024-09-11 19:22:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:38,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:38,527 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:22:38,528 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:22:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:38,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:22:38,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:38,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418229050] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:38,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-11 19:22:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634216024] [2024-09-11 19:22:38,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:38,643 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:22:38,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:38,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:22:38,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:22:38,643 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:22:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:38,741 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-09-11 19:22:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:22:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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 11 [2024-09-11 19:22:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:38,742 INFO L225 Difference]: With dead ends: 48 [2024-09-11 19:22:38,742 INFO L226 Difference]: Without dead ends: 46 [2024-09-11 19:22:38,742 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:22:38,744 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:38,745 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 70 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-11 19:22:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2024-09-11 19:22:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 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:22:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-09-11 19:22:38,756 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 11 [2024-09-11 19:22:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:38,756 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-09-11 19:22:38,756 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:22:38,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-09-11 19:22:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:22:38,757 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:38,757 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:38,769 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:38,957 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:38,958 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:38,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1304338695, now seen corresponding path program 1 times [2024-09-11 19:22:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668867743] [2024-09-11 19:22:38,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:39,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668867743] [2024-09-11 19:22:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668867743] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877364032] [2024-09-11 19:22:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:39,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:39,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:39,037 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:22:39,038 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:22:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:22:39,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:39,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877364032] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:39,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-11 19:22:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974217294] [2024-09-11 19:22:39,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:39,135 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:22:39,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:22:39,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:22:39,136 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:22:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:39,239 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-09-11 19:22:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:22:39,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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 11 [2024-09-11 19:22:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:39,241 INFO L225 Difference]: With dead ends: 52 [2024-09-11 19:22:39,241 INFO L226 Difference]: Without dead ends: 50 [2024-09-11 19:22:39,242 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:22:39,242 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:39,242 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 76 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-11 19:22:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2024-09-11 19:22:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 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:22:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-09-11 19:22:39,254 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 11 [2024-09-11 19:22:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:39,254 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-09-11 19:22:39,254 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:22:39,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-09-11 19:22:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 19:22:39,256 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:39,256 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:39,268 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:39,456 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:39,456 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:39,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1259805830, now seen corresponding path program 1 times [2024-09-11 19:22:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:39,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897347854] [2024-09-11 19:22:39,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:39,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897347854] [2024-09-11 19:22:39,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897347854] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:39,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536169003] [2024-09-11 19:22:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:39,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:39,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:39,496 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:22:39,497 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:22:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:22:39,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:39,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:22:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536169003] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:39,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:22:39,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-09-11 19:22:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295335275] [2024-09-11 19:22:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:39,553 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:39,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:39,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:39,554 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:22:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:39,567 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2024-09-11 19:22:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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) Word has length 14 [2024-09-11 19:22:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:39,569 INFO L225 Difference]: With dead ends: 47 [2024-09-11 19:22:39,570 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 19:22:39,570 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:39,571 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 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:22:39,572 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 19:22:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-09-11 19:22:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:22:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-09-11 19:22:39,579 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-09-11 19:22:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:39,580 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-09-11 19:22:39,580 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:22:39,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-09-11 19:22:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-11 19:22:39,580 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:39,580 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:39,592 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:22:39,784 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:39,785 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:39,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2079561522, now seen corresponding path program 1 times [2024-09-11 19:22:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:39,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17285516] [2024-09-11 19:22:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:39,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:39,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:39,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17285516] [2024-09-11 19:22:39,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17285516] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:39,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963238602] [2024-09-11 19:22:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:39,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:39,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:39,852 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:22:39,853 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:22:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:39,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:22:39,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:22:39,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:22:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963238602] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:39,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:22:39,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-09-11 19:22:39,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057331350] [2024-09-11 19:22:39,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:39,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:22:39,923 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:22:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:39,935 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-09-11 19:22:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Word has length 16 [2024-09-11 19:22:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:39,936 INFO L225 Difference]: With dead ends: 18 [2024-09-11 19:22:39,936 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:22:39,936 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:22:39,937 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:39,937 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:22:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:22:39,937 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:22:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:22:39,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-09-11 19:22:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:39,937 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:22:39,938 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:22:39,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:22:39,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:22:39,941 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:22:39,953 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:40,142 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:22:40,145 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:40,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:22:40,398 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:22:40,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:22:40 BoogieIcfgContainer [2024-09-11 19:22:40,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:22:40,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:22:40,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:22:40,413 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:22:40,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:37" (3/4) ... [2024-09-11 19:22:40,415 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:22:40,419 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-11 19:22:40,419 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-11 19:22:40,419 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:22:40,419 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:22:40,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:22:40,489 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:22:40,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:22:40,489 INFO L158 Benchmark]: Toolchain (without parser) took 3760.17ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 103.9MB in the beginning and 104.6MB in the end (delta: -672.1kB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-09-11 19:22:40,489 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 119.5MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:40,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.95ms. Allocated memory is still 159.4MB. Free memory was 103.9MB in the beginning and 92.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:22:40,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.50ms. Allocated memory is still 159.4MB. Free memory was 92.3MB in the beginning and 90.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:40,490 INFO L158 Benchmark]: Boogie Preprocessor took 22.22ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 88.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:40,490 INFO L158 Benchmark]: RCFGBuilder took 270.89ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 76.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 19:22:40,491 INFO L158 Benchmark]: TraceAbstraction took 3162.22ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 76.3MB in the beginning and 109.8MB in the end (delta: -33.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:40,491 INFO L158 Benchmark]: Witness Printer took 79.23ms. Allocated memory is still 209.7MB. Free memory was 109.8MB in the beginning and 104.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 19:22:40,492 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.12ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 119.5MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.95ms. Allocated memory is still 159.4MB. Free memory was 103.9MB in the beginning and 92.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.50ms. Allocated memory is still 159.4MB. Free memory was 92.3MB in the beginning and 90.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.22ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 88.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 270.89ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 76.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3162.22ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 76.3MB in the beginning and 109.8MB in the end (delta: -33.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 79.23ms. Allocated memory is still 209.7MB. Free memory was 109.8MB in the beginning and 104.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 100 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 52 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 8 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 17/35 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: 24]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 17]: Location Invariant Derived location invariant: null - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((1 <= i) && (2000 <= c2)) && (2000 <= k)) && (4000 <= c1)) && (n <= 1)) && (10000 <= c3)) || (((((i == 0) && (2000 <= c2)) && (4000 <= c1)) && (k == 0)) && (10000 <= c3))) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((n <= 0) && (j == 0)) || ((((((2000 <= c2) && (4000 <= c1)) && (1 <= j)) && (1 <= k)) && (n <= 1)) && (10000 <= c3))) || ((((((2000 <= c2) && (2000 <= k)) && (4000 <= c1)) && (0 <= j)) && (n <= 1)) && (10000 <= c3))) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:22:40,514 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE