./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/gcd01-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 27b49876 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/gcd01-1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ceea5216a7b51ee21eab36f0e9b129c25f18193871fb4ca0aa52ef8740fc0ce8 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-27b4987-m [2024-09-21 12:25:15,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 12:25:15,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 12:25:15,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 12:25:15,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 12:25:15,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 12:25:15,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 12:25:15,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 12:25:15,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 12:25:15,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 12:25:15,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 12:25:15,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 12:25:15,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 12:25:15,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 12:25:15,926 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 12:25:15,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 12:25:15,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 12:25:15,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 12:25:15,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 12:25:15,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 12:25:15,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 12:25:15,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 12:25:15,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 12:25:15,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 12:25:15,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 12:25:15,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 12:25:15,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 12:25:15,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 12:25:15,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 12:25:15,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 12:25:15,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 12:25:15,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 12:25:15,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 12:25:15,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 12:25:15,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 12:25:15,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 12:25:15,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 12:25:15,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 12:25:15,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 12:25:15,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 12:25:15,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 12:25:15,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 12:25:15,934 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 -> ceea5216a7b51ee21eab36f0e9b129c25f18193871fb4ca0aa52ef8740fc0ce8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-21 12:25:16,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 12:25:16,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 12:25:16,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 12:25:16,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 12:25:16,198 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 12:25:16,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/gcd01-1.c [2024-09-21 12:25:17,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 12:25:17,710 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 12:25:17,710 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd01-1.c [2024-09-21 12:25:17,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/31610f032/6f3439696a224c8ab425af16660d0175/FLAGad1f5f647 [2024-09-21 12:25:18,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/31610f032/6f3439696a224c8ab425af16660d0175 [2024-09-21 12:25:18,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 12:25:18,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 12:25:18,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 12:25:18,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 12:25:18,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 12:25:18,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4648e154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18, skipping insertion in model container [2024-09-21 12:25:18,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 12:25:18,245 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd01-1.c[1008,1021] [2024-09-21 12:25:18,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 12:25:18,256 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 12:25:18,267 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd01-1.c[1008,1021] [2024-09-21 12:25:18,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 12:25:18,281 INFO L204 MainTranslator]: Completed translation [2024-09-21 12:25:18,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18 WrapperNode [2024-09-21 12:25:18,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 12:25:18,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 12:25:18,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 12:25:18,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 12:25:18,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,299 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 12:25:18,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 12:25:18,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 12:25:18,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 12:25:18,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 12:25:18,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-21 12:25:18,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 12:25:18,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 12:25:18,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 12:25:18,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 12:25:18,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (1/1) ... [2024-09-21 12:25:18,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 12:25:18,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:18,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-21 12:25:18,383 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-21 12:25:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 12:25:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 12:25:18,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 12:25:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-09-21 12:25:18,435 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-09-21 12:25:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 12:25:18,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 12:25:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 12:25:18,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 12:25:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 12:25:18,485 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 12:25:18,487 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 12:25:18,588 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-09-21 12:25:18,588 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 12:25:18,609 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 12:25:18,609 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-21 12:25:18,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:25:18 BoogieIcfgContainer [2024-09-21 12:25:18,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 12:25:18,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 12:25:18,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 12:25:18,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 12:25:18,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 12:25:18" (1/3) ... [2024-09-21 12:25:18,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad8078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:25:18, skipping insertion in model container [2024-09-21 12:25:18,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:18" (2/3) ... [2024-09-21 12:25:18,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad8078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:25:18, skipping insertion in model container [2024-09-21 12:25:18,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:25:18" (3/3) ... [2024-09-21 12:25:18,618 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2024-09-21 12:25:18,631 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 12:25:18,631 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 12:25:18,669 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 12:25:18,674 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;@6b7dd355, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 12:25:18,675 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 12:25:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-21 12:25:18,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-21 12:25:18,684 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:18,684 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:18,684 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:18,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1824526305, now seen corresponding path program 1 times [2024-09-21 12:25:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:18,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365512301] [2024-09-21 12:25:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-21 12:25:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:25:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:19,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365512301] [2024-09-21 12:25:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365512301] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:19,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 12:25:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378380798] [2024-09-21 12:25:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:19,015 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 12:25:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:19,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 12:25:19,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:25:19,036 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 12:25:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:19,147 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-09-21 12:25:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:25:19,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-21 12:25:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:19,155 INFO L225 Difference]: With dead ends: 40 [2024-09-21 12:25:19,155 INFO L226 Difference]: Without dead ends: 26 [2024-09-21 12:25:19,157 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:25:19,160 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:19,160 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 12:25:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-21 12:25:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-21 12:25:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-21 12:25:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-09-21 12:25:19,192 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2024-09-21 12:25:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:19,193 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-09-21 12:25:19,193 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 12:25:19,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-09-21 12:25:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-21 12:25:19,195 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:19,195 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:19,195 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 12:25:19,195 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:19,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash -154441507, now seen corresponding path program 1 times [2024-09-21 12:25:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359652989] [2024-09-21 12:25:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:19,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-21 12:25:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:25:19,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359652989] [2024-09-21 12:25:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359652989] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:19,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:19,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 12:25:19,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460161359] [2024-09-21 12:25:19,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:19,283 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 12:25:19,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:19,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 12:25:19,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:25:19,284 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-21 12:25:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:19,317 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-09-21 12:25:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:25:19,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-21 12:25:19,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:19,318 INFO L225 Difference]: With dead ends: 30 [2024-09-21 12:25:19,318 INFO L226 Difference]: Without dead ends: 26 [2024-09-21 12:25:19,319 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:25:19,320 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:19,320 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 117 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 12:25:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-21 12:25:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-21 12:25:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-21 12:25:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-09-21 12:25:19,328 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2024-09-21 12:25:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:19,328 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-09-21 12:25:19,328 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-21 12:25:19,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-09-21 12:25:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-21 12:25:19,329 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:19,330 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:19,330 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 12:25:19,330 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:19,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash 771084881, now seen corresponding path program 1 times [2024-09-21 12:25:19,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:19,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717908027] [2024-09-21 12:25:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-21 12:25:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:25:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717908027] [2024-09-21 12:25:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717908027] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:19,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-21 12:25:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469408981] [2024-09-21 12:25:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:19,606 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-21 12:25:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:19,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-21 12:25:19,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-21 12:25:19,607 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-21 12:25:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:19,685 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-09-21 12:25:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-21 12:25:19,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-21 12:25:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:19,687 INFO L225 Difference]: With dead ends: 36 [2024-09-21 12:25:19,687 INFO L226 Difference]: Without dead ends: 28 [2024-09-21 12:25:19,687 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-09-21 12:25:19,688 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:19,689 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 67 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 12:25:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-21 12:25:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-09-21 12:25:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-21 12:25:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-09-21 12:25:19,695 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2024-09-21 12:25:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:19,696 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-09-21 12:25:19,696 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-21 12:25:19,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-09-21 12:25:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-21 12:25:19,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:19,697 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:19,697 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-21 12:25:19,698 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:19,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2116844627, now seen corresponding path program 1 times [2024-09-21 12:25:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:19,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145149549] [2024-09-21 12:25:19,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:19,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-21 12:25:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:25:19,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:19,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145149549] [2024-09-21 12:25:19,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145149549] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:19,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:19,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 12:25:19,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122610401] [2024-09-21 12:25:19,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:19,810 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 12:25:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:19,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 12:25:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:25:19,811 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-21 12:25:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:19,883 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-09-21 12:25:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:25:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-21 12:25:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:19,885 INFO L225 Difference]: With dead ends: 36 [2024-09-21 12:25:19,885 INFO L226 Difference]: Without dead ends: 26 [2024-09-21 12:25:19,885 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-21 12:25:19,887 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:19,889 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 12:25:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-21 12:25:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-21 12:25:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-21 12:25:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-21 12:25:19,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 23 [2024-09-21 12:25:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:19,900 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-21 12:25:19,900 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-21 12:25:19,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-21 12:25:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-21 12:25:19,902 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:19,902 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:19,902 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-21 12:25:19,903 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:19,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1957492243, now seen corresponding path program 1 times [2024-09-21 12:25:19,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:19,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810207953] [2024-09-21 12:25:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-21 12:25:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,012 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-21 12:25:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810207953] [2024-09-21 12:25:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810207953] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:20,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:20,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-21 12:25:20,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944715525] [2024-09-21 12:25:20,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:20,046 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-21 12:25:20,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-21 12:25:20,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-21 12:25:20,046 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-21 12:25:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:20,093 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-09-21 12:25:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-21 12:25:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-21 12:25:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:20,095 INFO L225 Difference]: With dead ends: 31 [2024-09-21 12:25:20,096 INFO L226 Difference]: Without dead ends: 27 [2024-09-21 12:25:20,096 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-21 12:25:20,097 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:20,100 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 12:25:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-21 12:25:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-09-21 12:25:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-21 12:25:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-21 12:25:20,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2024-09-21 12:25:20,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:20,111 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-21 12:25:20,111 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-21 12:25:20,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-21 12:25:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-21 12:25:20,113 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:20,113 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:20,113 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-21 12:25:20,113 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:20,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1098623821, now seen corresponding path program 1 times [2024-09-21 12:25:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099916390] [2024-09-21 12:25:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-21 12:25:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:25:20,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:20,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099916390] [2024-09-21 12:25:20,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099916390] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:25:20,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576354290] [2024-09-21 12:25:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:20,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:20,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:20,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:25:20,225 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-21 12:25:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-21 12:25:20,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:25:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 12:25:20,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 12:25:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576354290] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:20,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-21 12:25:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 10 [2024-09-21 12:25:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460704640] [2024-09-21 12:25:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:20,324 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-21 12:25:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-21 12:25:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-21 12:25:20,325 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-21 12:25:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:20,366 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-09-21 12:25:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-21 12:25:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-21 12:25:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:20,368 INFO L225 Difference]: With dead ends: 34 [2024-09-21 12:25:20,368 INFO L226 Difference]: Without dead ends: 30 [2024-09-21 12:25:20,368 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-21 12:25:20,369 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:20,369 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 12:25:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-21 12:25:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-21 12:25:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-21 12:25:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-09-21 12:25:20,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2024-09-21 12:25:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:20,378 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-09-21 12:25:20,378 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-21 12:25:20,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-09-21 12:25:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-21 12:25:20,379 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:20,379 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:20,393 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-21 12:25:20,580 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-21 12:25:20,581 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:20,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1001556931, now seen corresponding path program 1 times [2024-09-21 12:25:20,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:20,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754865187] [2024-09-21 12:25:20,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:20,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-21 12:25:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 12:25:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754865187] [2024-09-21 12:25:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754865187] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:25:20,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551323289] [2024-09-21 12:25:20,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:20,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:20,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:20,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:25:20,770 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-21 12:25:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-21 12:25:20,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:25:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-21 12:25:20,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 12:25:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551323289] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:20,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-21 12:25:20,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 13 [2024-09-21 12:25:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980292111] [2024-09-21 12:25:20,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:20,884 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-21 12:25:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:20,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-21 12:25:20,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-09-21 12:25:20,885 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-21 12:25:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:20,959 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-09-21 12:25:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-21 12:25:20,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-09-21 12:25:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:20,960 INFO L225 Difference]: With dead ends: 30 [2024-09-21 12:25:20,960 INFO L226 Difference]: Without dead ends: 0 [2024-09-21 12:25:20,961 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-09-21 12:25:20,961 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:20,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 12:25:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-21 12:25:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-21 12:25:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-21 12:25:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-21 12:25:20,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2024-09-21 12:25:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:20,963 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-21 12:25:20,963 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-21 12:25:20,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-21 12:25:20,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-21 12:25:20,969 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-21 12:25:20,992 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-21 12:25:21,169 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-21 12:25:21,173 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:21,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-21 12:25:21,341 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-21 12:25:21,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 12:25:21 BoogieIcfgContainer [2024-09-21 12:25:21,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-21 12:25:21,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-21 12:25:21,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-21 12:25:21,356 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-21 12:25:21,356 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:25:18" (3/4) ... [2024-09-21 12:25:21,358 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-21 12:25:21,415 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-21 12:25:21,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-21 12:25:21,415 INFO L158 Benchmark]: Toolchain (without parser) took 3297.18ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 97.0MB in the beginning and 115.2MB in the end (delta: -18.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2024-09-21 12:25:21,416 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 12:25:21,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.75ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 85.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-21 12:25:21,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.54ms. Allocated memory is still 167.8MB. Free memory was 85.5MB in the beginning and 84.6MB in the end (delta: 907.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 12:25:21,416 INFO L158 Benchmark]: Boogie Preprocessor took 48.53ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 137.7MB in the end (delta: -53.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-09-21 12:25:21,417 INFO L158 Benchmark]: RCFGBuilder took 261.34ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 137.6MB in the beginning and 209.1MB in the end (delta: -71.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-09-21 12:25:21,417 INFO L158 Benchmark]: TraceAbstraction took 2740.16ms. Allocated memory is still 247.5MB. Free memory was 209.1MB in the beginning and 117.3MB in the end (delta: 91.8MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2024-09-21 12:25:21,417 INFO L158 Benchmark]: Witness Printer took 62.76ms. Allocated memory is still 247.5MB. Free memory was 117.3MB in the beginning and 115.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 12:25:21,419 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.16ms. Allocated memory is still 167.8MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.75ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 85.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.54ms. Allocated memory is still 167.8MB. Free memory was 85.5MB in the beginning and 84.6MB in the end (delta: 907.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.53ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 137.7MB in the end (delta: -53.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * RCFGBuilder took 261.34ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 137.6MB in the beginning and 209.1MB in the end (delta: -71.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2740.16ms. Allocated memory is still 247.5MB. Free memory was 209.1MB in the beginning and 117.3MB in the end (delta: 91.8MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Witness Printer took 62.76ms. Allocated memory is still 247.5MB. Free memory was 117.3MB in the beginning and 115.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 666 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 517 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 149 mSDtfsCounter, 328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, InterpolantAutomatonStates: 50, 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, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 48/55 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 - ProcedureContractResult [Line: 17]: Procedure Contract for gcd Derived contract for procedure gcd. Ensures: (((y2 < 1) || (y1 < 1)) || (0 < \result)) RESULT: Ultimate proved your program to be correct! [2024-09-21 12:25:21,466 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE