./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/gcd01-1.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 --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 20:25:09,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:25:09,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:25:09,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:25:09,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:25:09,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:25:09,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:25:09,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:25:09,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:25:09,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:25:09,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:25:09,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:25:09,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:25:09,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:25:09,200 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:25:09,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:25:09,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:25:09,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:25:09,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:25:09,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:25:09,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:25:09,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:25:09,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:25:09,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:25:09,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:25:09,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:25:09,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:25:09,205 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:25:09,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:25:09,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:25:09,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:25:09,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:25:09,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:25:09,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:25:09,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:25:09,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:25:09,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:25:09,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:25:09,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:25:09,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:25:09,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:25:09,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:25:09,211 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.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 20:25:09,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:25:09,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:25:09,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:25:09,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:25:09,481 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:25:09,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/gcd01-1.c [2024-09-11 20:25:10,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:25:11,092 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:25:11,093 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd01-1.c [2024-09-11 20:25:11,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c721710ee/cc6a8e658549487eb20fd3a624be4c33/FLAGfab6810d8 [2024-09-11 20:25:11,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c721710ee/cc6a8e658549487eb20fd3a624be4c33 [2024-09-11 20:25:11,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:25:11,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:25:11,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:25:11,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:25:11,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:25:11,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ff34a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11, skipping insertion in model container [2024-09-11 20:25:11,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:25:11,296 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/recursive/gcd01-1.c[1008,1021] [2024-09-11 20:25:11,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:25:11,322 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:25:11,341 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/recursive/gcd01-1.c[1008,1021] [2024-09-11 20:25:11,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:25:11,369 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:25:11,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11 WrapperNode [2024-09-11 20:25:11,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:25:11,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:25:11,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:25:11,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:25:11,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,404 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-09-11 20:25:11,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:25:11,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:25:11,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:25:11,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:25:11,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,435 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 20:25:11,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:25:11,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:25:11,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:25:11,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:25:11,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (1/1) ... [2024-09-11 20:25:11,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:25:11,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:11,482 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 20:25:11,488 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 20:25:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:25:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-09-11 20:25:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-09-11 20:25:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:25:11,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:25:11,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:25:11,579 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:25:11,580 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:25:11,697 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-09-11 20:25:11,697 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:25:11,721 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:25:11,721 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:25:11,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:11 BoogieIcfgContainer [2024-09-11 20:25:11,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:25:11,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:25:11,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:25:11,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:25:11,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:25:11" (1/3) ... [2024-09-11 20:25:11,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c45dd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:25:11, skipping insertion in model container [2024-09-11 20:25:11,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:11" (2/3) ... [2024-09-11 20:25:11,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c45dd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:25:11, skipping insertion in model container [2024-09-11 20:25:11,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:11" (3/3) ... [2024-09-11 20:25:11,730 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2024-09-11 20:25:11,746 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:25:11,746 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:25:11,806 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:25:11,813 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;@6148d8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:25:11,814 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:25:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:25:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 20:25:11,825 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:11,826 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:11,826 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:11,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash -672472283, now seen corresponding path program 1 times [2024-09-11 20:25:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:11,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17482915] [2024-09-11 20:25:11,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:11,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,364 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 20:25:12,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17482915] [2024-09-11 20:25:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17482915] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:25:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165177615] [2024-09-11 20:25:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:12,378 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:25:12,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:25:12,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:12,403 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:25:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:12,530 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2024-09-11 20:25:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-11 20:25:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:12,541 INFO L225 Difference]: With dead ends: 31 [2024-09-11 20:25:12,541 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 20:25:12,544 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11 20:25:12,548 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:12,551 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 20:25:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-09-11 20:25:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:25:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-09-11 20:25:12,588 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2024-09-11 20:25:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:12,588 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-09-11 20:25:12,588 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:25:12,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-09-11 20:25:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-11 20:25:12,590 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:12,590 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:12,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:25:12,591 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:12,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1200358745, now seen corresponding path program 1 times [2024-09-11 20:25:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233549422] [2024-09-11 20:25:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,696 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 20:25:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233549422] [2024-09-11 20:25:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233549422] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:12,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:25:12,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831871643] [2024-09-11 20:25:12,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:12,699 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:25:12,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:12,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:25:12,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:12,700 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:25:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:12,735 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-09-11 20:25:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-11 20:25:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:12,736 INFO L225 Difference]: With dead ends: 26 [2024-09-11 20:25:12,736 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 20:25:12,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-11 20:25:12,738 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 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-11 20:25:12,738 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 20:25:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-09-11 20:25:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:25:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-09-11 20:25:12,751 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2024-09-11 20:25:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:12,752 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-09-11 20:25:12,752 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:25:12,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-09-11 20:25:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 20:25:12,753 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:12,754 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:12,754 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:25:12,754 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:12,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash -229059489, now seen corresponding path program 1 times [2024-09-11 20:25:12,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:12,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38025176] [2024-09-11 20:25:12,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:12,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,899 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,954 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-11 20:25:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38025176] [2024-09-11 20:25:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38025176] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:12,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:25:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033979182] [2024-09-11 20:25:12,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:12,956 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:25:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:25:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:12,957 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:13,072 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-09-11 20:25:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:13,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-11 20:25:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:13,074 INFO L225 Difference]: With dead ends: 32 [2024-09-11 20:25:13,074 INFO L226 Difference]: Without dead ends: 24 [2024-09-11 20:25:13,074 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:25:13,075 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:13,076 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 47 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-11 20:25:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-09-11 20:25:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:25:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-09-11 20:25:13,085 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2024-09-11 20:25:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:13,085 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-09-11 20:25:13,086 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:13,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-09-11 20:25:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 20:25:13,090 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:13,091 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:13,091 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:25:13,091 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:13,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1574819235, now seen corresponding path program 1 times [2024-09-11 20:25:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:13,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684366798] [2024-09-11 20:25:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,233 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,282 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-11 20:25:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684366798] [2024-09-11 20:25:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684366798] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:13,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 20:25:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570352208] [2024-09-11 20:25:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:13,285 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 20:25:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 20:25:13,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:25:13,296 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:13,409 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-09-11 20:25:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:25:13,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-11 20:25:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:13,411 INFO L225 Difference]: With dead ends: 32 [2024-09-11 20:25:13,411 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 20:25:13,412 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-11 20:25:13,414 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:13,416 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 46 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 20:25:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-09-11 20:25:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:25:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-09-11 20:25:13,430 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 19 [2024-09-11 20:25:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:13,430 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-09-11 20:25:13,431 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:13,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-09-11 20:25:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 20:25:13,432 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:13,432 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:13,432 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 20:25:13,432 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:13,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:13,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1175015767, now seen corresponding path program 1 times [2024-09-11 20:25:13,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:13,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761116950] [2024-09-11 20:25:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,580 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-11 20:25:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761116950] [2024-09-11 20:25:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761116950] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072913975] [2024-09-11 20:25:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:13,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:13,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:13,583 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 20:25:13,584 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 20:25:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:25:13,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:13,723 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-11 20:25:13,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:25:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072913975] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:13,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:25:13,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 10 [2024-09-11 20:25:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622696956] [2024-09-11 20:25:13,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:13,724 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 20:25:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:13,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 20:25:13,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:25:13,726 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:25:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:13,795 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-09-11 20:25:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:25:13,796 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-11 20:25:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:13,797 INFO L225 Difference]: With dead ends: 27 [2024-09-11 20:25:13,797 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 20:25:13,798 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 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-11 20:25:13,798 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:13,799 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 20:25:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-11 20:25:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:25:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-11 20:25:13,820 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 20 [2024-09-11 20:25:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:13,820 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-11 20:25:13,820 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:25:13,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-11 20:25:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 20:25:13,822 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:13,822 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:13,836 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:25:14,023 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:14,024 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:14,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 63835465, now seen corresponding path program 1 times [2024-09-11 20:25:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057560432] [2024-09-11 20:25:14,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,146 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-11 20:25:14,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:14,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057560432] [2024-09-11 20:25:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057560432] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:14,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:14,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 20:25:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266496844] [2024-09-11 20:25:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:14,147 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 20:25:14,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 20:25:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:25:14,149 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:14,205 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-09-11 20:25:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:25:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-09-11 20:25:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:14,206 INFO L225 Difference]: With dead ends: 30 [2024-09-11 20:25:14,206 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 20:25:14,207 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-11 20:25:14,208 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 103 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-11 20:25:14,208 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 103 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 20:25:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-11 20:25:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-11 20:25:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-09-11 20:25:14,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 20 [2024-09-11 20:25:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:14,219 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-09-11 20:25:14,219 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:14,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-09-11 20:25:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:25:14,221 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:14,221 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] [2024-09-11 20:25:14,221 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 20:25:14,221 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:14,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:14,221 INFO L85 PathProgramCache]: Analyzing trace with hash 915558905, now seen corresponding path program 1 times [2024-09-11 20:25:14,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:14,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911478383] [2024-09-11 20:25:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:25:14,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:14,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911478383] [2024-09-11 20:25:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911478383] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:14,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85587009] [2024-09-11 20:25:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:14,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:14,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:14,392 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 20:25:14,395 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 20:25:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 20:25:14,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:14,483 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-11 20:25:14,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:25:14,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85587009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:14,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:25:14,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2024-09-11 20:25:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755304739] [2024-09-11 20:25:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:14,486 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 20:25:14,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:14,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 20:25:14,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:25:14,487 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:25:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:14,580 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-09-11 20:25:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:25:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-09-11 20:25:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:14,582 INFO L225 Difference]: With dead ends: 26 [2024-09-11 20:25:14,583 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:25:14,583 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:25:14,584 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 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.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:14,584 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:25:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:25:14,585 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 20:25:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:25:14,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2024-09-11 20:25:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:14,587 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:25:14,587 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:25:14,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:25:14,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:25:14,590 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:25:14,607 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:25:14,791 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 20:25:14,794 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:14,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:25:15,051 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:25:15,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:25:15 BoogieIcfgContainer [2024-09-11 20:25:15,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:25:15,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:25:15,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:25:15,074 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:25:15,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:11" (3/4) ... [2024-09-11 20:25:15,076 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:25:15,080 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2024-09-11 20:25:15,085 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:25:15,085 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:25:15,085 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:25:15,086 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:25:15,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:25:15,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:25:15,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:25:15,178 INFO L158 Benchmark]: Toolchain (without parser) took 4064.25ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 109.7MB in the beginning and 126.9MB in the end (delta: -17.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-09-11 20:25:15,178 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:25:15,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.40ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 98.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:25:15,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.17ms. Allocated memory is still 163.6MB. Free memory was 98.3MB in the beginning and 96.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:25:15,179 INFO L158 Benchmark]: Boogie Preprocessor took 37.28ms. Allocated memory is still 163.6MB. Free memory was 96.9MB in the beginning and 95.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:25:15,179 INFO L158 Benchmark]: RCFGBuilder took 278.29ms. Allocated memory is still 163.6MB. Free memory was 95.0MB in the beginning and 83.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:25:15,180 INFO L158 Benchmark]: TraceAbstraction took 3348.77ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 82.9MB in the beginning and 132.2MB in the end (delta: -49.3MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-09-11 20:25:15,180 INFO L158 Benchmark]: Witness Printer took 104.40ms. Allocated memory is still 218.1MB. Free memory was 132.2MB in the beginning and 126.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 20:25:15,182 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.20ms. Allocated memory is still 163.6MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.40ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 98.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.17ms. Allocated memory is still 163.6MB. Free memory was 98.3MB in the beginning and 96.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.28ms. Allocated memory is still 163.6MB. Free memory was 96.9MB in the beginning and 95.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.29ms. Allocated memory is still 163.6MB. Free memory was 95.0MB in the beginning and 83.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3348.77ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 82.9MB in the beginning and 132.2MB in the end (delta: -49.3MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Witness Printer took 104.40ms. Allocated memory is still 218.1MB. Free memory was 132.2MB in the beginning and 126.9MB 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: 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 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 335 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 124 mSDtfsCounter, 335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred 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.3s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 175 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 49/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 - InvariantResult [Line: 30]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for gcd Derived contract for procedure gcd. Ensures: (((\old(y2) < 1) || (\old(y1) < 1)) || (0 < \result)) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:25:15,213 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