./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/nested6.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/nested6.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 327b0d5e70f014fe291a4771fe2bbb17cb1148e77fe8f6a261d10a47df8adacc --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:22:42,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:22:43,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:22:43,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:22:43,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:22:43,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:22:43,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:22:43,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:22:43,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:22:43,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:22:43,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:22:43,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:22:43,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:22:43,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:22:43,096 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:22:43,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:22:43,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:22:43,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:22:43,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:22:43,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:22:43,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:22:43,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:22:43,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:22:43,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:22:43,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:22:43,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:22:43,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:22:43,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:22:43,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:22:43,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:22:43,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:22:43,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:22:43,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:43,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:22:43,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:22:43,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:22:43,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:22:43,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:22:43,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:22:43,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:22:43,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:22:43,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:22:43,108 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 -> 327b0d5e70f014fe291a4771fe2bbb17cb1148e77fe8f6a261d10a47df8adacc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:22:43,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:22:43,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:22:43,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:22:43,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:22:43,409 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:22:43,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/nested6.i [2024-09-11 19:22:44,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:22:45,066 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:22:45,067 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/nested6.i [2024-09-11 19:22:45,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6db07e296/bbc3cbd562a0409dadd7484215ac8571/FLAG2b902d7c1 [2024-09-11 19:22:45,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6db07e296/bbc3cbd562a0409dadd7484215ac8571 [2024-09-11 19:22:45,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:22:45,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:22:45,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:45,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:22:45,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:22:45,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63defed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45, skipping insertion in model container [2024-09-11 19:22:45,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:22:45,286 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/nested6.i[893,906] [2024-09-11 19:22:45,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:45,307 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:22:45,316 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/nested6.i[893,906] [2024-09-11 19:22:45,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:45,336 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:22:45,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45 WrapperNode [2024-09-11 19:22:45,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:45,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:45,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:22:45,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:22:45,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,372 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-09-11 19:22:45,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:45,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:22:45,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:22:45,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:22:45,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,398 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 19:22:45,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:22:45,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:22:45,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:22:45,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:22:45,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:45,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:45,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 19:22:45,456 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 19:22:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:22:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:22:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:22:45,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:22:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:22:45,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:22:45,549 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:22:45,551 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:22:45,662 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-11 19:22:45,662 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:22:45,687 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:22:45,688 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-11 19:22:45,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:45 BoogieIcfgContainer [2024-09-11 19:22:45,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:22:45,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:22:45,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:22:45,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:22:45,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:22:45" (1/3) ... [2024-09-11 19:22:45,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438d158c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:45, skipping insertion in model container [2024-09-11 19:22:45,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (2/3) ... [2024-09-11 19:22:45,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438d158c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:45, skipping insertion in model container [2024-09-11 19:22:45,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:45" (3/3) ... [2024-09-11 19:22:45,698 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6.i [2024-09-11 19:22:45,719 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:22:45,719 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:22:45,776 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:22:45,785 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;@6a77c079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:22:45,785 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:22:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.6875) internal successors, (27), 18 states have internal predecessors, (27), 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 19:22:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:22:45,798 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:45,799 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:45,799 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:45,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1174528960, now seen corresponding path program 1 times [2024-09-11 19:22:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767446412] [2024-09-11 19:22:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:45,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767446412] [2024-09-11 19:22:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767446412] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:46,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:46,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692819897] [2024-09-11 19:22:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:46,197 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:46,224 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.6875) internal successors, (27), 18 states have internal predecessors, (27), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:46,315 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2024-09-11 19:22:46,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:46,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:22:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:46,327 INFO L225 Difference]: With dead ends: 45 [2024-09-11 19:22:46,328 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 19:22:46,331 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11 19:22:46,335 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:46,337 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 19:22:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-11 19:22:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 19:22:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-11 19:22:46,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2024-09-11 19:22:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:46,391 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-11 19:22:46,391 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:46,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-11 19:22:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:22:46,393 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:46,394 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:46,394 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:22:46,394 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:46,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1752396037, now seen corresponding path program 1 times [2024-09-11 19:22:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002719181] [2024-09-11 19:22:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002719181] [2024-09-11 19:22:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002719181] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:46,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:46,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539023473] [2024-09-11 19:22:46,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:46,578 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:46,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:46,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:46,581 INFO L87 Difference]: Start difference. First operand 23 states and 27 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:46,719 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-09-11 19:22:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:46,720 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-09-11 19:22:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:46,721 INFO L225 Difference]: With dead ends: 35 [2024-09-11 19:22:46,721 INFO L226 Difference]: Without dead ends: 33 [2024-09-11 19:22:46,722 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:22:46,723 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:46,723 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 75 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-11 19:22:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2024-09-11 19:22:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 19:22:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-09-11 19:22:46,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 11 [2024-09-11 19:22:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:46,749 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-09-11 19:22:46,749 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:46,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-09-11 19:22:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:22:46,751 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:46,751 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:46,751 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:22:46,751 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:46,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash 523209250, now seen corresponding path program 1 times [2024-09-11 19:22:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:46,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756901884] [2024-09-11 19:22:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:46,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756901884] [2024-09-11 19:22:46,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756901884] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:46,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:46,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:46,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989980265] [2024-09-11 19:22:46,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:46,873 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:46,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:46,878 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:46,958 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-09-11 19:22:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-11 19:22:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:46,960 INFO L225 Difference]: With dead ends: 40 [2024-09-11 19:22:46,960 INFO L226 Difference]: Without dead ends: 38 [2024-09-11 19:22:46,960 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-11 19:22:46,961 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:46,961 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 63 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-11 19:22:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-11 19:22:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:22:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-11 19:22:46,985 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 15 [2024-09-11 19:22:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:46,986 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-11 19:22:46,986 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:46,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-11 19:22:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:22:46,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:46,989 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 19:22:46,989 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:22:46,990 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:46,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash -242896495, now seen corresponding path program 1 times [2024-09-11 19:22:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808055471] [2024-09-11 19:22:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,100 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 19:22:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:47,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808055471] [2024-09-11 19:22:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808055471] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322151759] [2024-09-11 19:22:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:47,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:47,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:47,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:22:47,112 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 19:22:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-11 19:22:47,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 19:22:47,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:22:47,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322151759] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:47,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:22:47,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-09-11 19:22:47,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308169641] [2024-09-11 19:22:47,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:47,269 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:47,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:22:47,270 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:47,397 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2024-09-11 19:22:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:47,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-11 19:22:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:47,400 INFO L225 Difference]: With dead ends: 101 [2024-09-11 19:22:47,402 INFO L226 Difference]: Without dead ends: 66 [2024-09-11 19:22:47,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:22:47,403 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:47,405 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-11 19:22:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2024-09-11 19:22:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:22:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-09-11 19:22:47,429 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 19 [2024-09-11 19:22:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:47,429 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-09-11 19:22:47,429 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:47,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-09-11 19:22:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-11 19:22:47,430 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:47,431 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:47,451 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:22:47,631 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:47,632 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:47,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash 738070152, now seen corresponding path program 1 times [2024-09-11 19:22:47,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273648142] [2024-09-11 19:22:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:22:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:22:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:22:47,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273648142] [2024-09-11 19:22:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273648142] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72719486] [2024-09-11 19:22:47,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:47,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:47,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:47,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:22:47,794 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 19:22:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-11 19:22:47,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 19:22:47,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:22:47,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72719486] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:47,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:47,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2024-09-11 19:22:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318861825] [2024-09-11 19:22:47,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:47,953 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 19:22:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 19:22:47,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:22:47,954 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-11 19:22:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:48,320 INFO L93 Difference]: Finished difference Result 110 states and 145 transitions. [2024-09-11 19:22:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-11 19:22:48,320 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 26 [2024-09-11 19:22:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:48,322 INFO L225 Difference]: With dead ends: 110 [2024-09-11 19:22:48,322 INFO L226 Difference]: Without dead ends: 86 [2024-09-11 19:22:48,323 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:22:48,323 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:48,324 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 111 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-11 19:22:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2024-09-11 19:22:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 47 states have internal predecessors, (57), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 19:22:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2024-09-11 19:22:48,346 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 26 [2024-09-11 19:22:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:48,346 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2024-09-11 19:22:48,346 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-11 19:22:48,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2024-09-11 19:22:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-11 19:22:48,348 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:48,349 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:48,367 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:48,550 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:48,550 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:48,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash 595286361, now seen corresponding path program 1 times [2024-09-11 19:22:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:48,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093798549] [2024-09-11 19:22:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:22:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:22:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:22:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093798549] [2024-09-11 19:22:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093798549] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:48,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539252361] [2024-09-11 19:22:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:48,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:48,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:48,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:22:48,684 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 19:22:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:22:48,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:22:48,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:22:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539252361] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:48,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-09-11 19:22:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476499328] [2024-09-11 19:22:48,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:48,950 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 19:22:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 19:22:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-09-11 19:22:48,952 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-11 19:22:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:49,146 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2024-09-11 19:22:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:22:49,146 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2024-09-11 19:22:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:49,149 INFO L225 Difference]: With dead ends: 123 [2024-09-11 19:22:49,150 INFO L226 Difference]: Without dead ends: 76 [2024-09-11 19:22:49,151 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-09-11 19:22:49,152 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 49 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:49,152 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 123 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-11 19:22:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2024-09-11 19:22:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 51 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:22:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2024-09-11 19:22:49,186 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 36 [2024-09-11 19:22:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:49,186 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2024-09-11 19:22:49,187 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-11 19:22:49,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2024-09-11 19:22:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 19:22:49,189 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:49,189 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:49,207 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:22:49,390 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:22:49,390 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:49,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 994443109, now seen corresponding path program 1 times [2024-09-11 19:22:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:49,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122555476] [2024-09-11 19:22:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 19:22:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 19:22:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122555476] [2024-09-11 19:22:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122555476] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313619033] [2024-09-11 19:22:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:49,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:49,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:49,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:22:49,480 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 19:22:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:22:49,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:22:49,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 19:22:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313619033] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:49,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:49,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-11 19:22:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192350755] [2024-09-11 19:22:49,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:49,664 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:22:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:49,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:22:49,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:22:49,666 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-11 19:22:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:49,760 INFO L93 Difference]: Finished difference Result 132 states and 172 transitions. [2024-09-11 19:22:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:49,761 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 38 [2024-09-11 19:22:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:49,762 INFO L225 Difference]: With dead ends: 132 [2024-09-11 19:22:49,762 INFO L226 Difference]: Without dead ends: 87 [2024-09-11 19:22:49,763 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:22:49,764 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:49,764 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 116 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-11 19:22:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2024-09-11 19:22:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 19:22:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-09-11 19:22:49,811 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 38 [2024-09-11 19:22:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:49,811 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-09-11 19:22:49,811 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-11 19:22:49,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-09-11 19:22:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-11 19:22:49,813 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:49,817 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:49,833 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:22:50,018 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:50,018 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:50,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash -462091481, now seen corresponding path program 1 times [2024-09-11 19:22:50,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:50,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3143779] [2024-09-11 19:22:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:50,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:50,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:50,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:50,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:22:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:50,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-11 19:22:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-11 19:22:50,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3143779] [2024-09-11 19:22:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3143779] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065003754] [2024-09-11 19:22:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:50,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:22:50,127 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 19:22:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:50,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:22:50,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 19:22:50,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-11 19:22:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065003754] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:50,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 14 [2024-09-11 19:22:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963786455] [2024-09-11 19:22:50,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:50,418 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 19:22:50,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 19:22:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-09-11 19:22:50,419 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-11 19:22:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:50,878 INFO L93 Difference]: Finished difference Result 155 states and 215 transitions. [2024-09-11 19:22:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-11 19:22:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 49 [2024-09-11 19:22:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:50,880 INFO L225 Difference]: With dead ends: 155 [2024-09-11 19:22:50,881 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:22:50,882 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-09-11 19:22:50,885 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:50,885 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 97 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:22:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:22:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:22:50,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2024-09-11 19:22:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:50,886 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:22:50,886 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-11 19:22:50,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:22:50,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:22:50,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:22:50,910 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:51,095 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-11 19:22:51,099 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:51,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:22:54,006 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:22:54,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:22:54 BoogieIcfgContainer [2024-09-11 19:22:54,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:22:54,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:22:54,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:22:54,025 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:22:54,026 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:45" (3/4) ... [2024-09-11 19:22:54,027 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:22:54,031 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 19:22:54,035 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-11 19:22:54,035 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 19:22:54,035 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:22:54,035 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:22:54,127 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:22:54,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:22:54,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:22:54,128 INFO L158 Benchmark]: Toolchain (without parser) took 9006.96ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 135.7MB in the beginning and 117.1MB in the end (delta: 18.6MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. [2024-09-11 19:22:54,129 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 163.6MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:54,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.54ms. Allocated memory is still 163.6MB. Free memory was 135.1MB in the beginning and 123.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:22:54,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.25ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 122.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:54,129 INFO L158 Benchmark]: Boogie Preprocessor took 47.31ms. Allocated memory is still 163.6MB. Free memory was 122.6MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:54,129 INFO L158 Benchmark]: RCFGBuilder took 267.61ms. Allocated memory is still 163.6MB. Free memory was 120.5MB in the beginning and 108.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 19:22:54,130 INFO L158 Benchmark]: TraceAbstraction took 8332.78ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 107.9MB in the beginning and 122.3MB in the end (delta: -14.4MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2024-09-11 19:22:54,130 INFO L158 Benchmark]: Witness Printer took 103.18ms. Allocated memory is still 243.3MB. Free memory was 121.3MB in the beginning and 117.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:22:54,131 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.25ms. Allocated memory is still 163.6MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.54ms. Allocated memory is still 163.6MB. Free memory was 135.1MB in the beginning and 123.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.25ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 122.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.31ms. Allocated memory is still 163.6MB. Free memory was 122.6MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 267.61ms. Allocated memory is still 163.6MB. Free memory was 120.5MB in the beginning and 108.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8332.78ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 107.9MB in the beginning and 122.3MB in the end (delta: -14.4MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. * Witness Printer took 103.18ms. Allocated memory is still 243.3MB. Free memory was 121.3MB in the beginning and 117.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 705 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 579 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 798 IncrementalHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 126 mSDtfsCounter, 798 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 308 SyntacticMatches, 11 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=7, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 1288 SizeOfPredicates, 20 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 398/439 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 24]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (k == n) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((long long) 2 * i) <= j) && (k == n)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((long long) 2 * i) <= j) && (k <= n)) && (((long long) j + 1) <= n)) && (((long long) 2 * i) <= k)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:22:54,153 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