./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:22:17,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:22:17,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:22:17,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:22:17,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:22:17,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:22:17,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:22:17,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:22:17,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:22:17,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:22:17,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:22:17,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:22:17,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:22:17,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:22:17,329 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:22:17,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:22:17,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:22:17,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:22:17,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:22:17,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:22:17,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:22:17,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:22:17,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:22:17,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:22:17,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:22:17,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:22:17,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:22:17,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:22:17,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:22:17,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:22:17,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:22:17,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:22:17,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:22:17,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:22:17,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:22:17,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:22:17,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:22:17,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:22:17,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:22:17,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:22:17,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:22:17,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:22:17,347 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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-25 10:22:17,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:22:17,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:22:17,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:22:17,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:22:17,667 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:22:17,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-25 10:22:19,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:22:19,433 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:22:19,434 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-25 10:22:19,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/781f9e008/85bf66fe77e5463fb828d8bc908b9db9/FLAGe0978e1b7 [2024-09-25 10:22:19,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/781f9e008/85bf66fe77e5463fb828d8bc908b9db9 [2024-09-25 10:22:19,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:22:19,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:22:19,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:22:19,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:22:19,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:22:19,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7215b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19, skipping insertion in model container [2024-09-25 10:22:19,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:22:19,665 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2024-09-25 10:22:19,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:22:19,714 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:22:19,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2024-09-25 10:22:19,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:22:19,758 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:22:19,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19 WrapperNode [2024-09-25 10:22:19,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:22:19,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:22:19,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:22:19,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:22:19,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,785 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:22:19,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:22:19,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:22:19,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:22:19,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:22:19,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,823 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-25 10:22:19,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:22:19,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:22:19,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:22:19,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:22:19,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (1/1) ... [2024-09-25 10:22:19,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:22:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:22:19,874 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-25 10:22:19,878 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-25 10:22:19,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:22:19,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:22:19,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:22:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:22:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:22:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:22:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:22:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:22:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:22:19,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:22:20,042 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:22:20,045 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:22:20,326 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-25 10:22:20,327 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:22:20,354 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:22:20,355 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:22:20,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:20 BoogieIcfgContainer [2024-09-25 10:22:20,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:22:20,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:22:20,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:22:20,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:22:20,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:22:19" (1/3) ... [2024-09-25 10:22:20,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28723607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:22:20, skipping insertion in model container [2024-09-25 10:22:20,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:22:19" (2/3) ... [2024-09-25 10:22:20,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28723607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:22:20, skipping insertion in model container [2024-09-25 10:22:20,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:20" (3/3) ... [2024-09-25 10:22:20,366 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-09-25 10:22:20,390 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:22:20,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:22:20,458 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:22:20,465 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;@2547c065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:22:20,465 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:22:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-25 10:22:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:22:20,478 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:20,478 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:20,480 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:20,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1997840557, now seen corresponding path program 1 times [2024-09-25 10:22:20,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:20,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599476250] [2024-09-25 10:22:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:20,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:20,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:20,836 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-25 10:22:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599476250] [2024-09-25 10:22:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599476250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:22:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918721900] [2024-09-25 10:22:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:20,844 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:22:20,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:22:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:22:20,871 INFO L87 Difference]: Start difference. First operand has 53 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:21,071 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2024-09-25 10:22:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:22:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:22:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:21,082 INFO L225 Difference]: With dead ends: 111 [2024-09-25 10:22:21,083 INFO L226 Difference]: Without dead ends: 63 [2024-09-25 10:22:21,087 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:21,091 INFO L434 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:21,093 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 259 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-25 10:22:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-09-25 10:22:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:22:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-09-25 10:22:21,148 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2024-09-25 10:22:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:21,149 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-09-25 10:22:21,149 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:22:21,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-09-25 10:22:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:22:21,151 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:21,151 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:21,152 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:22:21,152 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:21,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash 348964071, now seen corresponding path program 1 times [2024-09-25 10:22:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125854291] [2024-09-25 10:22:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 10:22:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:22:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125854291] [2024-09-25 10:22:21,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125854291] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:21,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:21,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:21,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172190672] [2024-09-25 10:22:21,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:21,311 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:21,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:21,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:21,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:21,314 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:22:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:21,488 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2024-09-25 10:22:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:21,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-09-25 10:22:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:21,492 INFO L225 Difference]: With dead ends: 62 [2024-09-25 10:22:21,494 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 10:22:21,495 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:21,497 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:21,498 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 215 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 10:22:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-25 10:22:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:22:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-09-25 10:22:21,521 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2024-09-25 10:22:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:21,521 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-09-25 10:22:21,522 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:22:21,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-09-25 10:22:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-25 10:22:21,523 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:21,524 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:21,524 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:22:21,524 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:21,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2112377310, now seen corresponding path program 1 times [2024-09-25 10:22:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:21,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267431913] [2024-09-25 10:22:21,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 10:22:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 10:22:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 10:22:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 10:22:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:22:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 10:22:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:22:21,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267431913] [2024-09-25 10:22:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267431913] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:21,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:22:21,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162066278] [2024-09-25 10:22:21,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:21,626 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:22:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:21,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:22:21,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:22:21,628 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 10:22:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:21,661 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2024-09-25 10:22:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:22:21,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-09-25 10:22:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:21,663 INFO L225 Difference]: With dead ends: 89 [2024-09-25 10:22:21,663 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 10:22:21,664 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:22:21,665 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:21,666 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:22:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 10:22:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-25 10:22:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:22:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2024-09-25 10:22:21,682 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2024-09-25 10:22:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:21,683 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2024-09-25 10:22:21,683 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 10:22:21,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2024-09-25 10:22:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-25 10:22:21,689 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:21,689 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:21,689 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:22:21,689 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:21,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1527746620, now seen corresponding path program 1 times [2024-09-25 10:22:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114484330] [2024-09-25 10:22:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 10:22:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,972 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 10:22:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 10:22:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 10:22:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:21,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:22:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:22:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:22:22,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:22,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114484330] [2024-09-25 10:22:22,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114484330] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:22,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:22,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:22,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484429750] [2024-09-25 10:22:22,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:22,024 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:22,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:22,027 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 10:22:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:22,157 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2024-09-25 10:22:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 51 [2024-09-25 10:22:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:22,159 INFO L225 Difference]: With dead ends: 67 [2024-09-25 10:22:22,159 INFO L226 Difference]: Without dead ends: 65 [2024-09-25 10:22:22,160 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:22,161 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:22,161 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 162 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-25 10:22:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-09-25 10:22:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:22:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-09-25 10:22:22,177 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2024-09-25 10:22:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:22,178 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-09-25 10:22:22,178 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 10:22:22,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-09-25 10:22:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-25 10:22:22,181 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:22,181 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:22,181 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:22:22,182 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:22,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1740534074, now seen corresponding path program 1 times [2024-09-25 10:22:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:22,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210342780] [2024-09-25 10:22:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 10:22:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 10:22:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 10:22:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 10:22:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:22:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:22:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-25 10:22:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-25 10:22:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:22:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 10:22:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 10:22:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-25 10:22:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-25 10:22:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210342780] [2024-09-25 10:22:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210342780] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:22,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211854063] [2024-09-25 10:22:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:22,432 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:22,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:22,434 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-09-25 10:22:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:22,524 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-09-25 10:22:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-09-25 10:22:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:22,529 INFO L225 Difference]: With dead ends: 73 [2024-09-25 10:22:22,529 INFO L226 Difference]: Without dead ends: 71 [2024-09-25 10:22:22,530 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:22,532 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:22:22,535 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 277 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-25 10:22:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-09-25 10:22:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:22:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-09-25 10:22:22,563 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 86 [2024-09-25 10:22:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:22,566 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-09-25 10:22:22,566 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-09-25 10:22:22,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-09-25 10:22:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-25 10:22:22,572 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:22:22,572 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:22:22,572 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:22:22,573 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:22:22,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 268638176, now seen corresponding path program 1 times [2024-09-25 10:22:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:22:22,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532103640] [2024-09-25 10:22:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:22:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:22:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:22:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 10:22:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 10:22:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 10:22:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 10:22:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:22:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:22:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-25 10:22:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-25 10:22:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:22:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 10:22:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 10:22:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-25 10:22:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-25 10:22:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:22:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-25 10:22:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:22:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532103640] [2024-09-25 10:22:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532103640] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:22:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:22:22,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:22:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461978275] [2024-09-25 10:22:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:22:22,757 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:22:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:22:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:22:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:22:22,759 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 10:22:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:22:22,846 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2024-09-25 10:22:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:22:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2024-09-25 10:22:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:22:22,848 INFO L225 Difference]: With dead ends: 74 [2024-09-25 10:22:22,848 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:22:22,849 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:22:22,851 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 293 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-25 10:22:22,851 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 293 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:22:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:22:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:22:22,855 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-25 10:22:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:22:22,856 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-09-25 10:22:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:22:22,856 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:22:22,856 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 10:22:22,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:22:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:22:22,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:22:22,859 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:22:22,862 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:22:22,864 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-25 10:22:22,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:22:23,345 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:22:23,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:22:23,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:22:23,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:22:23,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:22:23,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:22:23,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:22:23,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:22:23,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:22:23,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:22:23,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:22:23,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:22:23,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:22:23,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:22:23,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:22:23,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:22:23,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:22:23,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:22:23 BoogieIcfgContainer [2024-09-25 10:22:23,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:22:23,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:22:23,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:22:23,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:22:23,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:22:20" (3/4) ... [2024-09-25 10:22:23,385 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:22:23,439 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:22:23,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:22:23,440 INFO L158 Benchmark]: Toolchain (without parser) took 3977.72ms. Allocated memory was 73.4MB in the beginning and 111.1MB in the end (delta: 37.7MB). Free memory was 52.2MB in the beginning and 80.7MB in the end (delta: -28.5MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-09-25 10:22:23,442 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 73.4MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:22:23,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.90ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 39.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 10:22:23,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.76ms. Allocated memory is still 73.4MB. Free memory was 39.7MB in the beginning and 38.8MB in the end (delta: 926.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:22:23,444 INFO L158 Benchmark]: Boogie Preprocessor took 49.13ms. Allocated memory is still 73.4MB. Free memory was 38.6MB in the beginning and 36.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:22:23,444 INFO L158 Benchmark]: RCFGBuilder took 517.04ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 36.9MB in the beginning and 59.9MB in the end (delta: -23.0MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-09-25 10:22:23,446 INFO L158 Benchmark]: TraceAbstraction took 3024.01ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 59.1MB in the beginning and 82.8MB in the end (delta: -23.7MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-09-25 10:22:23,446 INFO L158 Benchmark]: Witness Printer took 57.26ms. Allocated memory is still 111.1MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:22:23,447 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 73.4MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.90ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 39.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.76ms. Allocated memory is still 73.4MB. Free memory was 39.7MB in the beginning and 38.8MB in the end (delta: 926.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.13ms. Allocated memory is still 73.4MB. Free memory was 38.6MB in the beginning and 36.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 517.04ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 36.9MB in the beginning and 59.9MB in the end (delta: -23.0MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3024.01ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 59.1MB in the beginning and 82.8MB in the end (delta: -23.7MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 57.26ms. Allocated memory is still 111.1MB. Free memory was 82.8MB in the beginning and 80.7MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 1332 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 954 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 378 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((long long) cp + 1) <= urilen) && (c == 0)) && (1 <= cp)) || (((1 <= c) && (((long long) cp + 1) <= urilen)) && (1 <= cp))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((long long) cp + 1) <= urilen) && (1 <= cp)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:22:23,482 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE